TSTP Solution File: SWW400-1 by E-SAT---3.2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.2.0
% Problem  : SWW400-1 : TPTP v8.2.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d SAT

% Computer : n021.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Jun 24 18:14:27 EDT 2024

% Result   : Unsatisfiable 1.25s 0.60s
% Output   : CNFRefutation 1.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   24 (  15 unt;   5 nHn;  20 RR)
%            Number of literals    :   38 (  12 equ;  15 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   41 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(unfolding_2,axiom,
    ( X1 = X2
    | heap(sep(lseg(X1,X3),X4))
    | ~ heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))) ),
    file('/export/starexec/sandbox2/tmp/tmp.loMLd4v3zt/E---3.1_11559.p',unfolding_2) ).

cnf(normalization,axiom,
    sep(lseg(X1,X1),X2) = X2,
    file('/export/starexec/sandbox2/tmp/tmp.loMLd4v3zt/E---3.1_11559.p',normalization) ).

cnf(unfolding_3,axiom,
    ( heap(sep(lseg(X1,nil),X3))
    | ~ heap(sep(lseg(X1,X2),sep(lseg(X2,nil),X3))) ),
    file('/export/starexec/sandbox2/tmp/tmp.loMLd4v3zt/E---3.1_11559.p',unfolding_3) ).

cnf(associative_commutative,axiom,
    sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
    file('/export/starexec/sandbox2/tmp/tmp.loMLd4v3zt/E---3.1_11559.p',associative_commutative) ).

cnf(premise_3,hypothesis,
    heap(sep(next(x2,nil),sep(lseg(x1,x2),emp))),
    file('/export/starexec/sandbox2/tmp/tmp.loMLd4v3zt/E---3.1_11559.p',premise_3) ).

cnf(premise_2,hypothesis,
    nil != x2,
    file('/export/starexec/sandbox2/tmp/tmp.loMLd4v3zt/E---3.1_11559.p',premise_2) ).

cnf(conclusion_1,negated_conjecture,
    ~ heap(sep(lseg(x1,nil),emp)),
    file('/export/starexec/sandbox2/tmp/tmp.loMLd4v3zt/E---3.1_11559.p',conclusion_1) ).

cnf(c_0_7,plain,
    ( X1 = X2
    | heap(sep(lseg(X1,X3),X4))
    | ~ heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))) ),
    inference(fof_simplification,[status(thm)],[unfolding_2]) ).

cnf(c_0_8,plain,
    ( X1 = X2
    | heap(sep(lseg(X1,X3),X4))
    | ~ heap(sep(next(X1,X2),sep(lseg(X2,X3),X4))) ),
    c_0_7 ).

cnf(c_0_9,axiom,
    sep(lseg(X1,X1),X2) = X2,
    normalization ).

cnf(c_0_10,plain,
    ( heap(sep(lseg(X1,nil),X3))
    | ~ heap(sep(lseg(X1,X2),sep(lseg(X2,nil),X3))) ),
    inference(fof_simplification,[status(thm)],[unfolding_3]) ).

cnf(c_0_11,plain,
    ( X1 = X2
    | heap(sep(lseg(X1,X2),X3))
    | ~ heap(sep(next(X1,X2),X3)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,axiom,
    sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
    associative_commutative ).

cnf(c_0_13,hypothesis,
    heap(sep(next(x2,nil),sep(lseg(x1,x2),emp))),
    premise_3 ).

cnf(c_0_14,hypothesis,
    nil != x2,
    inference(fof_simplification,[status(thm)],[premise_2]) ).

cnf(c_0_15,plain,
    ( heap(sep(lseg(X1,nil),X3))
    | ~ heap(sep(lseg(X1,X2),sep(lseg(X2,nil),X3))) ),
    c_0_10 ).

cnf(c_0_16,plain,
    ( X1 = X2
    | heap(sep(lseg(X1,X2),sep(X3,X4)))
    | ~ heap(sep(X3,sep(next(X1,X2),X4))) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_17,hypothesis,
    heap(sep(lseg(x1,x2),sep(next(x2,nil),emp))),
    inference(rw,[status(thm)],[c_0_13,c_0_12]) ).

cnf(c_0_18,hypothesis,
    nil != x2,
    c_0_14 ).

cnf(c_0_19,negated_conjecture,
    ~ heap(sep(lseg(x1,nil),emp)),
    inference(fof_simplification,[status(thm)],[conclusion_1]) ).

cnf(c_0_20,plain,
    ( heap(sep(lseg(X1,nil),X2))
    | ~ heap(sep(lseg(X3,nil),sep(lseg(X1,X3),X2))) ),
    inference(spm,[status(thm)],[c_0_15,c_0_12]) ).

cnf(c_0_21,hypothesis,
    heap(sep(lseg(x2,nil),sep(lseg(x1,x2),emp))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    ~ heap(sep(lseg(x1,nil),emp)),
    c_0_19 ).

cnf(c_0_23,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : SWW400-1 : TPTP v8.2.0. Released v5.2.0.
% 0.10/0.12  % Command    : run_E %s %d SAT
% 0.11/0.33  % Computer : n021.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit   : 300
% 0.11/0.33  % WCLimit    : 300
% 0.11/0.33  % DateTime   : Wed Jun 19 07:03:54 EDT 2024
% 0.11/0.33  % CPUTime    : 
% 0.19/0.47  Running first-order model finding
% 0.19/0.47  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.loMLd4v3zt/E---3.1_11559.p
% 1.25/0.60  # Version: 3.2.0
% 1.25/0.60  # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.25/0.60  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.25/0.60  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.25/0.60  # Starting new_bool_3 with 300s (1) cores
% 1.25/0.60  # Starting new_bool_1 with 300s (1) cores
% 1.25/0.60  # Starting sh5l with 300s (1) cores
% 1.25/0.60  # sh5l with pid 11639 completed with status 0
% 1.25/0.60  # Result found by sh5l
% 1.25/0.60  # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.25/0.60  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.25/0.60  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.25/0.60  # Starting new_bool_3 with 300s (1) cores
% 1.25/0.60  # Starting new_bool_1 with 300s (1) cores
% 1.25/0.60  # Starting sh5l with 300s (1) cores
% 1.25/0.60  # SinE strategy is gf500_gu_R04_F100_L20000
% 1.25/0.60  # Search class: FGUSS-FFSF22-MFFFFFNN
% 1.25/0.60  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.25/0.60  # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 1.25/0.60  # SAT001_MinMin_p005000_rr_RG with pid 11647 completed with status 0
% 1.25/0.60  # Result found by SAT001_MinMin_p005000_rr_RG
% 1.25/0.60  # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.25/0.60  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.25/0.60  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.25/0.60  # Starting new_bool_3 with 300s (1) cores
% 1.25/0.60  # Starting new_bool_1 with 300s (1) cores
% 1.25/0.60  # Starting sh5l with 300s (1) cores
% 1.25/0.60  # SinE strategy is gf500_gu_R04_F100_L20000
% 1.25/0.60  # Search class: FGUSS-FFSF22-MFFFFFNN
% 1.25/0.60  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.25/0.60  # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 1.25/0.60  # Preprocessing time       : 0.001 s
% 1.25/0.60  # Presaturation interreduction done
% 1.25/0.60  
% 1.25/0.60  # Proof found!
% 1.25/0.60  # SZS status Unsatisfiable
% 1.25/0.60  # SZS output start CNFRefutation
% See solution above
% 1.25/0.60  # Parsed axioms                        : 15
% 1.25/0.60  # Removed by relevancy pruning/SinE    : 0
% 1.25/0.60  # Initial clauses                      : 15
% 1.25/0.60  # Removed in clause preprocessing      : 0
% 1.25/0.60  # Initial clauses in saturation        : 15
% 1.25/0.60  # Processed clauses                    : 1261
% 1.25/0.60  # ...of these trivial                  : 0
% 1.25/0.60  # ...subsumed                          : 1145
% 1.25/0.60  # ...remaining for further processing  : 116
% 1.25/0.60  # Other redundant clauses eliminated   : 0
% 1.25/0.60  # Clauses deleted for lack of memory   : 0
% 1.25/0.60  # Backward-subsumed                    : 0
% 1.25/0.60  # Backward-rewritten                   : 1
% 1.25/0.60  # Generated clauses                    : 10036
% 1.25/0.60  # ...of the previous two non-redundant : 9990
% 1.25/0.60  # ...aggressively subsumed             : 0
% 1.25/0.60  # Contextual simplify-reflections      : 0
% 1.25/0.60  # Paramodulations                      : 10036
% 1.25/0.60  # Factorizations                       : 0
% 1.25/0.60  # NegExts                              : 0
% 1.25/0.60  # Equation resolutions                 : 0
% 1.25/0.60  # Disequality decompositions           : 0
% 1.25/0.60  # Total rewrite steps                  : 138
% 1.25/0.60  # ...of those cached                   : 67
% 1.25/0.60  # Propositional unsat checks           : 0
% 1.25/0.60  #    Propositional check models        : 0
% 1.25/0.60  #    Propositional check unsatisfiable : 0
% 1.25/0.60  #    Propositional clauses             : 0
% 1.25/0.60  #    Propositional clauses after purity: 0
% 1.25/0.60  #    Propositional unsat core size     : 0
% 1.25/0.60  #    Propositional preprocessing time  : 0.000
% 1.25/0.60  #    Propositional encoding time       : 0.000
% 1.25/0.60  #    Propositional solver time         : 0.000
% 1.25/0.60  #    Success case prop preproc time    : 0.000
% 1.25/0.60  #    Success case prop encoding time   : 0.000
% 1.25/0.60  #    Success case prop solver time     : 0.000
% 1.25/0.60  # Current number of processed clauses  : 100
% 1.25/0.60  #    Positive orientable unit clauses  : 3
% 1.25/0.60  #    Positive unorientable unit clauses: 13
% 1.25/0.60  #    Negative unit clauses             : 23
% 1.25/0.60  #    Non-unit-clauses                  : 61
% 1.25/0.60  # Current number of unprocessed clauses: 8759
% 1.25/0.60  # ...number of literals in the above   : 15650
% 1.25/0.60  # Current number of archived formulas  : 0
% 1.25/0.60  # Current number of archived clauses   : 16
% 1.25/0.60  # Clause-clause subsumption calls (NU) : 1822
% 1.25/0.60  # Rec. Clause-clause subsumption calls : 1822
% 1.25/0.60  # Non-unit clause-clause subsumptions  : 347
% 1.25/0.60  # Unit Clause-clause subsumption calls : 53
% 1.25/0.60  # Rewrite failures with RHS unbound    : 0
% 1.25/0.60  # BW rewrite match attempts            : 1705
% 1.25/0.60  # BW rewrite match successes           : 694
% 1.25/0.60  # Condensation attempts                : 0
% 1.25/0.60  # Condensation successes               : 0
% 1.25/0.60  # Termbank termtop insertions          : 133884
% 1.25/0.60  # Search garbage collected termcells   : 31
% 1.25/0.60  
% 1.25/0.60  # -------------------------------------------------
% 1.25/0.60  # User time                : 0.104 s
% 1.25/0.60  # System time              : 0.007 s
% 1.25/0.60  # Total time               : 0.111 s
% 1.25/0.60  # Maximum resident set size: 1572 pages
% 1.25/0.60  
% 1.25/0.60  # -------------------------------------------------
% 1.25/0.60  # User time                : 0.105 s
% 1.25/0.60  # System time              : 0.008 s
% 1.25/0.60  # Total time               : 0.113 s
% 1.25/0.60  # Maximum resident set size: 1704 pages
% 1.25/0.60  % E---3.1 exiting
% 1.25/0.60  % E exiting
%------------------------------------------------------------------------------