TSTP Solution File: SWW425-1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SWW425-1 : TPTP v8.1.2. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n023.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 20:11:16 EDT 2023

% Result   : Unsatisfiable 0.14s 0.41s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   25 (  17 unt;   8 nHn;  21 RR)
%            Number of literals    :   37 (  25 equ;   9 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :   10 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-2 aty)
%            Number of variables   :   28 (   6 sgn)

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

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

cnf(premise_12,hypothesis,
    heap(sep(lseg(x5,x7),sep(lseg(x2,x5),sep(lseg(x2,x10),sep(lseg(x2,x1),sep(lseg(x9,x1),sep(lseg(x7,x6),sep(lseg(x3,x10),sep(lseg(x6,x9),emp))))))))),
    file('/export/starexec/sandbox2/tmp/tmp.lmajk9JtQJ/E---3.1_25072.p',premise_12) ).

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

cnf(premise_11,hypothesis,
    x2 != x7,
    file('/export/starexec/sandbox2/tmp/tmp.lmajk9JtQJ/E---3.1_25072.p',premise_11) ).

cnf(premise_3,hypothesis,
    x1 != x10,
    file('/export/starexec/sandbox2/tmp/tmp.lmajk9JtQJ/E---3.1_25072.p',premise_3) ).

cnf(c_0_6,axiom,
    ( X1 = X2
    | X1 = X3
    | ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))) ),
    wellformedness_5 ).

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

cnf(c_0_8,plain,
    ( X1 = X2
    | X1 = X3
    | ~ heap(sep(lseg(X1,X2),sep(X4,sep(lseg(X1,X3),X5)))) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_9,hypothesis,
    heap(sep(lseg(x5,x7),sep(lseg(x2,x5),sep(lseg(x2,x10),sep(lseg(x2,x1),sep(lseg(x9,x1),sep(lseg(x7,x6),sep(lseg(x3,x10),sep(lseg(x6,x9),emp))))))))),
    premise_12 ).

cnf(c_0_10,plain,
    ( X1 = X2
    | X1 = X3
    | ~ heap(sep(X4,sep(lseg(X1,X3),sep(lseg(X1,X2),X5)))) ),
    inference(spm,[status(thm)],[c_0_8,c_0_7]) ).

cnf(c_0_11,hypothesis,
    heap(sep(lseg(x7,x6),sep(lseg(x2,x1),sep(lseg(x2,x10),sep(lseg(x2,x5),sep(lseg(x6,x9),sep(lseg(x9,x1),sep(lseg(x3,x10),sep(lseg(x5,x7),emp))))))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]) ).

cnf(c_0_12,hypothesis,
    ( x1 = x2
    | x10 = x2 ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

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

cnf(c_0_14,hypothesis,
    ( x1 = x2
    | heap(sep(lseg(x7,x6),sep(lseg(x2,x1),sep(lseg(x2,x5),sep(lseg(x6,x9),sep(lseg(x9,x1),sep(lseg(x3,x2),sep(lseg(x5,x7),emp)))))))) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).

cnf(c_0_15,hypothesis,
    ( x1 = x2
    | x5 = x2 ),
    inference(spm,[status(thm)],[c_0_10,c_0_14]) ).

cnf(c_0_16,hypothesis,
    ( x1 = x2
    | heap(sep(lseg(x7,x6),sep(lseg(x2,x7),sep(lseg(x2,x1),sep(lseg(x2,x10),sep(lseg(x6,x9),sep(lseg(x9,x1),sep(lseg(x3,x10),emp)))))))) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_15]),c_0_13]),c_0_7]),c_0_7]),c_0_7]),c_0_7]),c_0_7]) ).

cnf(c_0_17,hypothesis,
    x2 != x7,
    premise_11 ).

cnf(c_0_18,hypothesis,
    x1 = x2,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_16]),c_0_17]) ).

cnf(c_0_19,hypothesis,
    x1 != x10,
    premise_3 ).

cnf(c_0_20,hypothesis,
    heap(sep(lseg(x7,x6),sep(lseg(x2,x10),sep(lseg(x2,x5),sep(lseg(x6,x9),sep(lseg(x9,x2),sep(lseg(x3,x10),sep(lseg(x5,x7),emp)))))))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_18]),c_0_13]) ).

cnf(c_0_21,hypothesis,
    x10 != x2,
    inference(rw,[status(thm)],[c_0_19,c_0_18]) ).

cnf(c_0_22,hypothesis,
    x5 = x2,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_20]),c_0_21]) ).

cnf(c_0_23,hypothesis,
    heap(sep(lseg(x7,x6),sep(lseg(x2,x7),sep(lseg(x2,x10),sep(lseg(x6,x9),sep(lseg(x9,x2),sep(lseg(x3,x10),emp))))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_22]),c_0_18]),c_0_13]),c_0_18]),c_0_7]),c_0_13]),c_0_7]),c_0_7]),c_0_7]) ).

cnf(c_0_24,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_23]),c_0_21]),c_0_17]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09  % Problem    : SWW425-1 : TPTP v8.1.2. Released v5.2.0.
% 0.04/0.10  % Command    : run_E %s %d THM
% 0.09/0.30  % Computer : n023.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit   : 2400
% 0.09/0.30  % WCLimit    : 300
% 0.09/0.30  % DateTime   : Mon Oct  2 22:48:07 EDT 2023
% 0.09/0.30  % CPUTime    : 
% 0.14/0.40  Running first-order model finding
% 0.14/0.40  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.lmajk9JtQJ/E---3.1_25072.p
% 0.14/0.41  # Version: 3.1pre001
% 0.14/0.41  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.41  # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41  # Starting new_bool_1 with 300s (1) cores
% 0.14/0.41  # Starting sh5l with 300s (1) cores
% 0.14/0.41  # new_bool_3 with pid 25150 completed with status 0
% 0.14/0.41  # Result found by new_bool_3
% 0.14/0.41  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.41  # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41  # Search class: FGUSS-FFSF22-DFFFFFNN
% 0.14/0.41  # partial match(1): FGUSS-FFMF22-DFFFFFNN
% 0.14/0.41  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41  # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 80s (1) cores
% 0.14/0.41  # Y1006__C12_02_nc_F1_AE_CS_SP_S2S with pid 25155 completed with status 0
% 0.14/0.41  # Result found by Y1006__C12_02_nc_F1_AE_CS_SP_S2S
% 0.14/0.41  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/0.41  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/0.41  # Starting new_bool_3 with 300s (1) cores
% 0.14/0.41  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.41  # Search class: FGUSS-FFSF22-DFFFFFNN
% 0.14/0.41  # partial match(1): FGUSS-FFMF22-DFFFFFNN
% 0.14/0.41  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.41  # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 80s (1) cores
% 0.14/0.41  # Preprocessing time       : 0.001 s
% 0.14/0.41  # Presaturation interreduction done
% 0.14/0.41  
% 0.14/0.41  # Proof found!
% 0.14/0.41  # SZS status Unsatisfiable
% 0.14/0.41  # SZS output start CNFRefutation
% See solution above
% 0.14/0.41  # Parsed axioms                        : 24
% 0.14/0.41  # Removed by relevancy pruning/SinE    : 7
% 0.14/0.41  # Initial clauses                      : 17
% 0.14/0.41  # Removed in clause preprocessing      : 1
% 0.14/0.41  # Initial clauses in saturation        : 16
% 0.14/0.41  # Processed clauses                    : 81
% 0.14/0.41  # ...of these trivial                  : 0
% 0.14/0.41  # ...subsumed                          : 34
% 0.14/0.41  # ...remaining for further processing  : 47
% 0.14/0.41  # Other redundant clauses eliminated   : 0
% 0.14/0.41  # Clauses deleted for lack of memory   : 0
% 0.14/0.41  # Backward-subsumed                    : 0
% 0.14/0.41  # Backward-rewritten                   : 9
% 0.14/0.41  # Generated clauses                    : 122
% 0.14/0.41  # ...of the previous two non-redundant : 116
% 0.14/0.41  # ...aggressively subsumed             : 0
% 0.14/0.41  # Contextual simplify-reflections      : 0
% 0.14/0.41  # Paramodulations                      : 122
% 0.14/0.41  # Factorizations                       : 0
% 0.14/0.41  # NegExts                              : 0
% 0.14/0.41  # Equation resolutions                 : 0
% 0.14/0.41  # Total rewrite steps                  : 68
% 0.14/0.41  # Propositional unsat checks           : 0
% 0.14/0.41  #    Propositional check models        : 0
% 0.14/0.41  #    Propositional check unsatisfiable : 0
% 0.14/0.41  #    Propositional clauses             : 0
% 0.14/0.41  #    Propositional clauses after purity: 0
% 0.14/0.41  #    Propositional unsat core size     : 0
% 0.14/0.41  #    Propositional preprocessing time  : 0.000
% 0.14/0.41  #    Propositional encoding time       : 0.000
% 0.14/0.41  #    Propositional solver time         : 0.000
% 0.14/0.41  #    Success case prop preproc time    : 0.000
% 0.14/0.41  #    Success case prop encoding time   : 0.000
% 0.14/0.41  #    Success case prop solver time     : 0.000
% 0.14/0.41  # Current number of processed clauses  : 22
% 0.14/0.41  #    Positive orientable unit clauses  : 6
% 0.14/0.41  #    Positive unorientable unit clauses: 2
% 0.14/0.41  #    Negative unit clauses             : 9
% 0.14/0.41  #    Non-unit-clauses                  : 5
% 0.14/0.41  # Current number of unprocessed clauses: 66
% 0.14/0.41  # ...number of literals in the above   : 148
% 0.14/0.41  # Current number of archived formulas  : 0
% 0.14/0.41  # Current number of archived clauses   : 25
% 0.14/0.41  # Clause-clause subsumption calls (NU) : 56
% 0.14/0.41  # Rec. Clause-clause subsumption calls : 56
% 0.14/0.41  # Non-unit clause-clause subsumptions  : 22
% 0.14/0.41  # Unit Clause-clause subsumption calls : 45
% 0.14/0.41  # Rewrite failures with RHS unbound    : 0
% 0.14/0.41  # BW rewrite match attempts            : 34
% 0.14/0.41  # BW rewrite match successes           : 15
% 0.14/0.41  # Condensation attempts                : 0
% 0.14/0.41  # Condensation successes               : 0
% 0.14/0.41  # Termbank termtop insertions          : 1835
% 0.14/0.41  
% 0.14/0.41  # -------------------------------------------------
% 0.14/0.41  # User time                : 0.006 s
% 0.14/0.41  # System time              : 0.001 s
% 0.14/0.41  # Total time               : 0.007 s
% 0.14/0.41  # Maximum resident set size: 1636 pages
% 0.14/0.41  
% 0.14/0.41  # -------------------------------------------------
% 0.14/0.41  # User time                : 0.006 s
% 0.14/0.41  # System time              : 0.003 s
% 0.14/0.41  # Total time               : 0.010 s
% 0.14/0.41  # Maximum resident set size: 1700 pages
% 0.14/0.41  % E---3.1 exiting
%------------------------------------------------------------------------------