TSTP Solution File: SWW427-1 by E---3.2.0

View Problem - Process Solution

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

% Computer : n013.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:11:57 EDT 2024

% Result   : Unsatisfiable 0.19s 0.49s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   27 (  21 unt;   6 nHn;  23 RR)
%            Number of literals    :   36 (  24 equ;  10 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :   11 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;  11 con; 0-2 aty)
%            Number of variables   :   22 (   3 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.Ks2XHkXWgl/E---3.1_32657.p',wellformedness_5) ).

cnf(premise_10,hypothesis,
    heap(sep(lseg(x10,x1),sep(lseg(x9,x2),sep(lseg(x9,x7),sep(lseg(x7,x10),sep(lseg(x11,x9),sep(lseg(x11,x7),sep(lseg(x11,x3),sep(lseg(x11,x6),sep(lseg(x4,x5),emp)))))))))),
    file('/export/starexec/sandbox2/tmp/tmp.Ks2XHkXWgl/E---3.1_32657.p',premise_10) ).

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

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

cnf(premise_8,hypothesis,
    x7 != x9,
    file('/export/starexec/sandbox2/tmp/tmp.Ks2XHkXWgl/E---3.1_32657.p',premise_8) ).

cnf(premise_2,hypothesis,
    x1 != x11,
    file('/export/starexec/sandbox2/tmp/tmp.Ks2XHkXWgl/E---3.1_32657.p',premise_2) ).

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

cnf(c_0_7,hypothesis,
    heap(sep(lseg(x10,x1),sep(lseg(x9,x2),sep(lseg(x9,x7),sep(lseg(x7,x10),sep(lseg(x11,x9),sep(lseg(x11,x7),sep(lseg(x11,x3),sep(lseg(x11,x6),sep(lseg(x4,x5),emp)))))))))),
    premise_10 ).

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

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

cnf(c_0_10,hypothesis,
    heap(sep(lseg(x11,x7),sep(lseg(x11,x9),sep(lseg(x11,x3),sep(lseg(x11,x6),sep(lseg(x7,x10),sep(lseg(x9,x7),sep(lseg(x9,x2),sep(lseg(x4,x5),sep(lseg(x10,x1),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)],[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_7,c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]) ).

cnf(c_0_11,hypothesis,
    ( x7 = x11
    | x9 = x11 ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

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

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

cnf(c_0_14,hypothesis,
    ( x7 = x11
    | heap(sep(lseg(x11,x7),sep(lseg(x11,x7),sep(lseg(x11,x3),sep(lseg(x11,x2),sep(lseg(x11,x6),sep(lseg(x7,x10),sep(lseg(x4,x5),sep(lseg(x10,x1),emp))))))))) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]) ).

cnf(c_0_15,hypothesis,
    x7 != x9,
    inference(fof_simplification,[status(thm)],[premise_8]) ).

cnf(c_0_16,hypothesis,
    x7 = x11,
    inference(spm,[status(thm)],[c_0_9,c_0_14]) ).

cnf(c_0_17,hypothesis,
    x7 != x9,
    c_0_15 ).

cnf(c_0_18,hypothesis,
    heap(sep(lseg(x11,x9),sep(lseg(x11,x3),sep(lseg(x11,x10),sep(lseg(x11,x6),sep(lseg(x9,x11),sep(lseg(x9,x2),sep(lseg(x4,x5),sep(lseg(x10,x1),emp))))))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_16]),c_0_8]),c_0_12]) ).

cnf(c_0_19,hypothesis,
    x9 != x11,
    inference(rw,[status(thm)],[c_0_17,c_0_16]) ).

cnf(c_0_20,hypothesis,
    x3 = x11,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_18]),c_0_19]) ).

cnf(c_0_21,hypothesis,
    heap(sep(lseg(x11,x9),sep(lseg(x11,x10),sep(lseg(x11,x6),sep(lseg(x9,x11),sep(lseg(x9,x2),sep(lseg(x4,x5),sep(lseg(x10,x1),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_10,c_0_20]),c_0_16]),c_0_12]),c_0_16]),c_0_16]),c_0_8]),c_0_12]) ).

cnf(c_0_22,hypothesis,
    x10 = x11,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_21]),c_0_19]) ).

cnf(c_0_23,hypothesis,
    x1 != x11,
    inference(fof_simplification,[status(thm)],[premise_2]) ).

cnf(c_0_24,hypothesis,
    heap(sep(lseg(x11,x9),sep(lseg(x11,x1),sep(lseg(x11,x6),sep(lseg(x9,x11),sep(lseg(x9,x2),sep(lseg(x4,x5),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(spm,[status(thm)],[c_0_10,c_0_22]),c_0_16]),c_0_20]),c_0_16]),c_0_16]),c_0_12]),c_0_12]),c_0_12]),c_0_8]),c_0_8]),c_0_8]),c_0_8]) ).

cnf(c_0_25,hypothesis,
    x1 != x11,
    c_0_23 ).

cnf(c_0_26,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_24]),c_0_25]),c_0_19]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SWW427-1 : TPTP v8.2.0. Released v5.2.0.
% 0.03/0.12  % Command    : run_E %s %d THM
% 0.12/0.33  % Computer : n013.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Wed Jun 19 08:28:39 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.19/0.47  Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.Ks2XHkXWgl/E---3.1_32657.p
% 0.19/0.49  # Version: 3.2.0
% 0.19/0.49  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49  # Starting sh5l with 300s (1) cores
% 0.19/0.49  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 312 completed with status 0
% 0.19/0.49  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.19/0.49  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.49  # No SInE strategy applied
% 0.19/0.49  # Search class: FGUSS-FFMF22-DFFFFFNN
% 0.19/0.49  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49  # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 358s (1) cores
% 0.19/0.49  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.19/0.49  # Starting new_bool_3 with 298s (1) cores
% 0.19/0.49  # Starting new_bool_1 with 291s (1) cores
% 0.19/0.49  # Starting C07_19_nc_SAT001_MinMin_p005000_rr with 136s (1) cores
% 0.19/0.49  # Y1006__C12_02_nc_F1_AE_CS_SP_S2S with pid 318 completed with status 0
% 0.19/0.49  # Result found by Y1006__C12_02_nc_F1_AE_CS_SP_S2S
% 0.19/0.49  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.19/0.49  # No SInE strategy applied
% 0.19/0.49  # Search class: FGUSS-FFMF22-DFFFFFNN
% 0.19/0.49  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49  # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 358s (1) cores
% 0.19/0.49  # Preprocessing time       : 0.001 s
% 0.19/0.49  # Presaturation interreduction done
% 0.19/0.49  
% 0.19/0.49  # Proof found!
% 0.19/0.49  # SZS status Unsatisfiable
% 0.19/0.49  # SZS output start CNFRefutation
% See solution above
% 0.19/0.49  # Parsed axioms                        : 22
% 0.19/0.49  # Removed by relevancy pruning/SinE    : 0
% 0.19/0.49  # Initial clauses                      : 22
% 0.19/0.49  # Removed in clause preprocessing      : 1
% 0.19/0.49  # Initial clauses in saturation        : 21
% 0.19/0.49  # Processed clauses                    : 97
% 0.19/0.49  # ...of these trivial                  : 1
% 0.19/0.49  # ...subsumed                          : 32
% 0.19/0.49  # ...remaining for further processing  : 64
% 0.19/0.49  # Other redundant clauses eliminated   : 0
% 0.19/0.49  # Clauses deleted for lack of memory   : 0
% 0.19/0.49  # Backward-subsumed                    : 0
% 0.19/0.49  # Backward-rewritten                   : 12
% 0.19/0.49  # Generated clauses                    : 122
% 0.19/0.49  # ...of the previous two non-redundant : 114
% 0.19/0.49  # ...aggressively subsumed             : 0
% 0.19/0.49  # Contextual simplify-reflections      : 0
% 0.19/0.49  # Paramodulations                      : 122
% 0.19/0.49  # Factorizations                       : 0
% 0.19/0.49  # NegExts                              : 0
% 0.19/0.49  # Equation resolutions                 : 0
% 0.19/0.49  # Disequality decompositions           : 0
% 0.19/0.49  # Total rewrite steps                  : 124
% 0.19/0.49  # ...of those cached                   : 65
% 0.19/0.49  # Propositional unsat checks           : 0
% 0.19/0.49  #    Propositional check models        : 0
% 0.19/0.49  #    Propositional check unsatisfiable : 0
% 0.19/0.49  #    Propositional clauses             : 0
% 0.19/0.49  #    Propositional clauses after purity: 0
% 0.19/0.49  #    Propositional unsat core size     : 0
% 0.19/0.49  #    Propositional preprocessing time  : 0.000
% 0.19/0.49  #    Propositional encoding time       : 0.000
% 0.19/0.49  #    Propositional solver time         : 0.000
% 0.19/0.49  #    Success case prop preproc time    : 0.000
% 0.19/0.49  #    Success case prop encoding time   : 0.000
% 0.19/0.49  #    Success case prop solver time     : 0.000
% 0.19/0.49  # Current number of processed clauses  : 31
% 0.19/0.49  #    Positive orientable unit clauses  : 8
% 0.19/0.49  #    Positive unorientable unit clauses: 1
% 0.19/0.49  #    Negative unit clauses             : 11
% 0.19/0.49  #    Non-unit-clauses                  : 11
% 0.19/0.49  # Current number of unprocessed clauses: 56
% 0.19/0.49  # ...number of literals in the above   : 113
% 0.19/0.49  # Current number of archived formulas  : 0
% 0.19/0.49  # Current number of archived clauses   : 33
% 0.19/0.49  # Clause-clause subsumption calls (NU) : 59
% 0.19/0.49  # Rec. Clause-clause subsumption calls : 59
% 0.19/0.49  # Non-unit clause-clause subsumptions  : 15
% 0.19/0.49  # Unit Clause-clause subsumption calls : 98
% 0.19/0.49  # Rewrite failures with RHS unbound    : 0
% 0.19/0.49  # BW rewrite match attempts            : 85
% 0.19/0.49  # BW rewrite match successes           : 42
% 0.19/0.49  # Condensation attempts                : 0
% 0.19/0.49  # Condensation successes               : 0
% 0.19/0.49  # Termbank termtop insertions          : 2696
% 0.19/0.49  # Search garbage collected termcells   : 46
% 0.19/0.49  
% 0.19/0.49  # -------------------------------------------------
% 0.19/0.49  # User time                : 0.006 s
% 0.19/0.49  # System time              : 0.001 s
% 0.19/0.49  # Total time               : 0.007 s
% 0.19/0.49  # Maximum resident set size: 1648 pages
% 0.19/0.49  
% 0.19/0.49  # -------------------------------------------------
% 0.19/0.49  # User time                : 0.025 s
% 0.19/0.49  # System time              : 0.004 s
% 0.19/0.49  # Total time               : 0.029 s
% 0.19/0.49  # Maximum resident set size: 1720 pages
% 0.19/0.49  % E---3.1 exiting
% 0.19/0.49  % E exiting
%------------------------------------------------------------------------------