TSTP Solution File: SWW445-1 by E---3.1.00

View Problem - Process Solution

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

% Computer : n007.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 : Tue May 21 06:42:46 EDT 2024

% Result   : Unsatisfiable 2.34s 0.77s
% Output   : CNFRefutation 2.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   33 (  16 unt;  17 nHn;  27 RR)
%            Number of literals    :   58 (  40 equ;  11 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :   16 (   3 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   19 (  19 usr;  17 con; 0-2 aty)
%            Number of variables   :   62 (  19 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(wellformedness_5,axiom,
    ( X1 = X2
    | X1 = X3
    | ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',wellformedness_5) ).

cnf(associative_commutative,axiom,
    sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',associative_commutative) ).

cnf(premise_19,hypothesis,
    heap(sep(lseg(x5,x17),sep(lseg(x19,x1),sep(lseg(x4,x12),sep(lseg(x12,x20),sep(lseg(x12,x15),sep(lseg(x12,x11),sep(lseg(x2,x18),sep(lseg(x17,x14),sep(lseg(x7,x16),sep(lseg(x3,x20),sep(lseg(x3,x12),sep(lseg(x11,x12),sep(lseg(x6,x17),sep(lseg(x6,x19),emp))))))))))))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_19) ).

cnf(normalization,axiom,
    sep(lseg(X1,X1),X2) = X2,
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV013-0.ax',normalization) ).

cnf(premise_3,hypothesis,
    x3 != x20,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',premise_3) ).

cnf(c_0_5,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_6,plain,
    ( X1 = X2
    | X1 = X3
    | ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4))) ),
    c_0_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,x17),sep(lseg(x19,x1),sep(lseg(x4,x12),sep(lseg(x12,x20),sep(lseg(x12,x15),sep(lseg(x12,x11),sep(lseg(x2,x18),sep(lseg(x17,x14),sep(lseg(x7,x16),sep(lseg(x3,x20),sep(lseg(x3,x12),sep(lseg(x11,x12),sep(lseg(x6,x17),sep(lseg(x6,x19),emp))))))))))))))),
    premise_19 ).

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(x19,x1),sep(lseg(x12,x20),sep(lseg(x12,x11),sep(lseg(x12,x15),sep(lseg(x17,x14),sep(lseg(x4,x12),sep(lseg(x3,x20),sep(lseg(x3,x12),sep(lseg(x11,x12),sep(lseg(x7,x16),sep(lseg(x6,x19),sep(lseg(x6,x17),sep(lseg(x2,x18),sep(lseg(x5,x17),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)],[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]),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,plain,
    sep(X1,sep(X2,sep(X3,X4))) = sep(X3,sep(X1,sep(X2,X4))),
    inference(spm,[status(thm)],[c_0_7,c_0_7]) ).

cnf(c_0_13,hypothesis,
    ( x12 = x20
    | x11 = x12 ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

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

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

cnf(c_0_16,hypothesis,
    ( x12 = x20
    | heap(sep(lseg(x19,x1),sep(lseg(x12,x20),sep(lseg(x12,x15),sep(lseg(x17,x14),sep(lseg(x4,x12),sep(lseg(x3,x20),sep(lseg(x3,x12),sep(lseg(x7,x16),sep(lseg(x6,x19),sep(lseg(x6,x17),sep(lseg(x2,x18),sep(lseg(x5,x17),emp))))))))))))) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_13]),c_0_14]),c_0_14]) ).

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

cnf(c_0_18,plain,
    sep(X1,sep(X2,sep(X3,sep(X4,X5)))) = sep(X3,sep(X2,sep(X4,sep(X1,X5)))),
    inference(spm,[status(thm)],[c_0_12,c_0_12]) ).

cnf(c_0_19,hypothesis,
    ( x12 = x20
    | x15 = x12 ),
    inference(spm,[status(thm)],[c_0_10,c_0_16]) ).

cnf(c_0_20,hypothesis,
    x3 != x20,
    inference(fof_simplification,[status(thm)],[premise_3]) ).

cnf(c_0_21,plain,
    ( X1 = X2
    | X1 = X3
    | ~ heap(sep(X4,sep(X5,sep(X6,sep(X7,sep(lseg(X1,X2),sep(lseg(X1,X3),X8))))))) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,hypothesis,
    ( x12 = x20
    | heap(sep(lseg(x19,x1),sep(lseg(x12,x20),sep(lseg(x17,x14),sep(lseg(x4,x12),sep(lseg(x3,x20),sep(lseg(x3,x12),sep(lseg(x7,x16),sep(lseg(x6,x19),sep(lseg(x6,x17),sep(lseg(x2,x18),sep(lseg(x5,x17),emp)))))))))))) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_19]),c_0_14]) ).

cnf(c_0_23,hypothesis,
    x3 != x20,
    c_0_20 ).

cnf(c_0_24,hypothesis,
    ( x12 = x20
    | x3 = x12 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).

cnf(c_0_25,hypothesis,
    ( x15 = x12
    | x11 = x12 ),
    inference(spm,[status(thm)],[c_0_15,c_0_11]) ).

cnf(c_0_26,hypothesis,
    ( x12 = x20
    | heap(sep(lseg(x19,x1),sep(lseg(x12,x20),sep(lseg(x12,x20),sep(lseg(x12,x11),sep(lseg(x12,x15),sep(lseg(x17,x14),sep(lseg(x4,x12),sep(lseg(x11,x12),sep(lseg(x7,x16),sep(lseg(x6,x19),sep(lseg(x6,x17),sep(lseg(x2,x18),sep(lseg(x5,x17),emp)))))))))))))) ),
    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_24]),c_0_14]),c_0_7]),c_0_7]),c_0_7]),c_0_7]) ).

cnf(c_0_27,hypothesis,
    ( x11 = x12
    | heap(sep(lseg(x19,x1),sep(lseg(x12,x20),sep(lseg(x12,x11),sep(lseg(x17,x14),sep(lseg(x4,x12),sep(lseg(x3,x20),sep(lseg(x3,x12),sep(lseg(x11,x12),sep(lseg(x7,x16),sep(lseg(x6,x19),sep(lseg(x6,x17),sep(lseg(x2,x18),sep(lseg(x5,x17),emp)))))))))))))) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_25]),c_0_14]) ).

cnf(c_0_28,hypothesis,
    x12 = x20,
    inference(spm,[status(thm)],[c_0_10,c_0_26]) ).

cnf(c_0_29,hypothesis,
    ( x11 = x20
    | heap(sep(lseg(x19,x1),sep(lseg(x20,x11),sep(lseg(x17,x14),sep(lseg(x4,x20),sep(lseg(x3,x20),sep(lseg(x3,x20),sep(lseg(x11,x20),sep(lseg(x7,x16),sep(lseg(x6,x19),sep(lseg(x6,x17),sep(lseg(x2,x18),sep(lseg(x5,x17),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)],[c_0_27,c_0_28]),c_0_28]),c_0_28]),c_0_28]),c_0_28]),c_0_28]),c_0_14]) ).

cnf(c_0_30,hypothesis,
    x11 = x20,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_29]),c_0_23]) ).

cnf(c_0_31,hypothesis,
    heap(sep(lseg(x19,x1),sep(lseg(x20,x15),sep(lseg(x17,x14),sep(lseg(x4,x20),sep(lseg(x3,x20),sep(lseg(x3,x20),sep(lseg(x7,x16),sep(lseg(x6,x19),sep(lseg(x6,x17),sep(lseg(x2,x18),sep(lseg(x5,x17),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(spm,[status(thm)],[c_0_11,c_0_30]),c_0_28]),c_0_28]),c_0_28]),c_0_28]),c_0_28]),c_0_28]),c_0_14]),c_0_14]),c_0_14]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SWW445-1 : TPTP v8.2.0. Released v5.2.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n007.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sat May 18 20:58:08 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.20/0.49  Running first-order theorem proving
% 0.20/0.49  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/benchmark/theBenchmark.p
% 2.34/0.77  # Version: 3.1.0
% 2.34/0.77  # Preprocessing class: FSMSSMSMSSSNFFN.
% 2.34/0.77  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.34/0.77  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.34/0.77  # Starting new_bool_3 with 300s (1) cores
% 2.34/0.77  # Starting new_bool_1 with 300s (1) cores
% 2.34/0.77  # Starting sh5l with 300s (1) cores
% 2.34/0.77  # new_bool_3 with pid 1069 completed with status 0
% 2.34/0.77  # Result found by new_bool_3
% 2.34/0.77  # Preprocessing class: FSMSSMSMSSSNFFN.
% 2.34/0.77  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.34/0.77  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.34/0.77  # Starting new_bool_3 with 300s (1) cores
% 2.34/0.77  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.34/0.77  # Search class: FGUSS-FFSF22-DFFFFFNN
% 2.34/0.77  # partial match(1): FGUSS-FFMF22-DFFFFFNN
% 2.34/0.77  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.34/0.77  # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 80s (1) cores
% 2.34/0.77  # Y1006__C12_02_nc_F1_AE_CS_SP_S2S with pid 1073 completed with status 0
% 2.34/0.77  # Result found by Y1006__C12_02_nc_F1_AE_CS_SP_S2S
% 2.34/0.77  # Preprocessing class: FSMSSMSMSSSNFFN.
% 2.34/0.77  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.34/0.77  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.34/0.77  # Starting new_bool_3 with 300s (1) cores
% 2.34/0.77  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.34/0.77  # Search class: FGUSS-FFSF22-DFFFFFNN
% 2.34/0.77  # partial match(1): FGUSS-FFMF22-DFFFFFNN
% 2.34/0.77  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.34/0.77  # Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 80s (1) cores
% 2.34/0.77  # Preprocessing time       : 0.001 s
% 2.34/0.77  # Presaturation interreduction done
% 2.34/0.77  
% 2.34/0.77  # Proof found!
% 2.34/0.77  # SZS status Unsatisfiable
% 2.34/0.77  # SZS output start CNFRefutation
% See solution above
% 2.34/0.77  # Parsed axioms                        : 31
% 2.34/0.77  # Removed by relevancy pruning/SinE    : 7
% 2.34/0.77  # Initial clauses                      : 24
% 2.34/0.77  # Removed in clause preprocessing      : 1
% 2.34/0.77  # Initial clauses in saturation        : 23
% 2.34/0.77  # Processed clauses                    : 1449
% 2.34/0.77  # ...of these trivial                  : 0
% 2.34/0.77  # ...subsumed                          : 1326
% 2.34/0.77  # ...remaining for further processing  : 123
% 2.34/0.77  # Other redundant clauses eliminated   : 0
% 2.34/0.77  # Clauses deleted for lack of memory   : 0
% 2.34/0.77  # Backward-subsumed                    : 0
% 2.34/0.77  # Backward-rewritten                   : 16
% 2.34/0.77  # Generated clauses                    : 13990
% 2.34/0.77  # ...of the previous two non-redundant : 13956
% 2.34/0.77  # ...aggressively subsumed             : 0
% 2.34/0.77  # Contextual simplify-reflections      : 0
% 2.34/0.77  # Paramodulations                      : 13990
% 2.34/0.77  # Factorizations                       : 0
% 2.34/0.77  # NegExts                              : 0
% 2.34/0.77  # Equation resolutions                 : 0
% 2.34/0.77  # Disequality decompositions           : 0
% 2.34/0.77  # Total rewrite steps                  : 351
% 2.34/0.77  # ...of those cached                   : 198
% 2.34/0.77  # Propositional unsat checks           : 0
% 2.34/0.77  #    Propositional check models        : 0
% 2.34/0.77  #    Propositional check unsatisfiable : 0
% 2.34/0.77  #    Propositional clauses             : 0
% 2.34/0.77  #    Propositional clauses after purity: 0
% 2.34/0.77  #    Propositional unsat core size     : 0
% 2.34/0.77  #    Propositional preprocessing time  : 0.000
% 2.34/0.77  #    Propositional encoding time       : 0.000
% 2.34/0.77  #    Propositional solver time         : 0.000
% 2.34/0.77  #    Success case prop preproc time    : 0.000
% 2.34/0.77  #    Success case prop encoding time   : 0.000
% 2.34/0.77  #    Success case prop solver time     : 0.000
% 2.34/0.77  # Current number of processed clauses  : 84
% 2.34/0.77  #    Positive orientable unit clauses  : 6
% 2.34/0.77  #    Positive unorientable unit clauses: 21
% 2.34/0.77  #    Negative unit clauses             : 17
% 2.34/0.77  #    Non-unit-clauses                  : 40
% 2.34/0.77  # Current number of unprocessed clauses: 12533
% 2.34/0.77  # ...number of literals in the above   : 24967
% 2.34/0.77  # Current number of archived formulas  : 0
% 2.34/0.77  # Current number of archived clauses   : 39
% 2.34/0.77  # Clause-clause subsumption calls (NU) : 6339
% 2.34/0.77  # Rec. Clause-clause subsumption calls : 6334
% 2.34/0.77  # Non-unit clause-clause subsumptions  : 910
% 2.34/0.77  # Unit Clause-clause subsumption calls : 316
% 2.34/0.77  # Rewrite failures with RHS unbound    : 0
% 2.34/0.77  # BW rewrite match attempts            : 1928
% 2.34/0.77  # BW rewrite match successes           : 802
% 2.34/0.77  # Condensation attempts                : 0
% 2.34/0.77  # Condensation successes               : 0
% 2.34/0.77  # Termbank termtop insertions          : 199657
% 2.34/0.77  # Search garbage collected termcells   : 94
% 2.34/0.77  
% 2.34/0.77  # -------------------------------------------------
% 2.34/0.77  # User time                : 0.263 s
% 2.34/0.77  # System time              : 0.007 s
% 2.34/0.77  # Total time               : 0.270 s
% 2.34/0.77  # Maximum resident set size: 1792 pages
% 2.34/0.77  
% 2.34/0.77  # -------------------------------------------------
% 2.34/0.77  # User time                : 0.263 s
% 2.34/0.77  # System time              : 0.010 s
% 2.34/0.77  # Total time               : 0.274 s
% 2.34/0.77  # Maximum resident set size: 1764 pages
% 2.34/0.77  % E---3.1 exiting
% 2.34/0.77  % E exiting
%------------------------------------------------------------------------------