%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWW407-1 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 03:10:28 PM UTC 2026
% Result : Unsatisfiable 13.18s 2.52s
% Output : CNFRefutation 13.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 29 ( 18 unt; 6 nHn; 23 RR)
% Number of literals : 46 ( 15 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 70 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(unfolding_2,axiom,
( ~ heap(sep(next(X1,X2),sep(lseg(X2,X3),X4)))
| heap(sep(lseg(X1,X3),X4))
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV013-0.ax',unfolding_2) ).
cnf(normalization,axiom,
sep(lseg(X1,X1),X2) = X2,
file('/export/starexec/sandbox/benchmark/Axioms/SWV013-0.ax',normalization) ).
cnf(associative_commutative,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/SWV013-0.ax',associative_commutative) ).
cnf(unfolding_4,axiom,
( ~ heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(next(X3,X4),X5))))
| heap(sep(lseg(X1,X3),sep(next(X3,X4),X5))) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV013-0.ax',unfolding_4) ).
cnf(premise_9,hypothesis,
heap(sep(next(x1,x2),sep(lseg(x3,x1),sep(lseg(x4,nil),sep(next(x2,x4),emp))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_9) ).
cnf(premise_5,hypothesis,
x1 != x2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_5) ).
cnf(conclusion_1,negated_conjecture,
~ heap(sep(lseg(x4,nil),sep(next(x2,x4),sep(lseg(x3,x2),emp)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conclusion_1) ).
cnf(c_0_7,plain,
( ~ heap(sep(next(X1,X2),sep(lseg(X2,X3),X4)))
| heap(sep(lseg(X1,X3),X4))
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[unfolding_2]) ).
cnf(c_0_8,plain,
( ~ heap(sep(next(X1,X2),sep(lseg(X2,X3),X4)))
| heap(sep(lseg(X1,X3),X4))
| X1 = X2 ),
c_0_7 ).
cnf(c_0_9,axiom,
sep(lseg(X1,X1),X2) = X2,
normalization ).
cnf(c_0_10,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
associative_commutative ).
cnf(c_0_11,plain,
( ~ heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(next(X3,X4),X5))))
| heap(sep(lseg(X1,X3),sep(next(X3,X4),X5))) ),
inference(fof_simplification,[status(thm)],[unfolding_4]) ).
cnf(c_0_12,plain,
( ~ heap(sep(next(X1,X2),X3))
| heap(sep(lseg(X1,X2),X3))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
sep(X1,sep(X2,sep(X3,X4))) = sep(X3,sep(X1,sep(X2,X4))),
inference(spm,[status(thm)],[c_0_10,c_0_10]) ).
cnf(c_0_14,plain,
( ~ heap(sep(lseg(X1,X2),sep(lseg(X2,X3),sep(next(X3,X4),X5))))
| heap(sep(lseg(X1,X3),sep(next(X3,X4),X5))) ),
c_0_11 ).
cnf(c_0_15,plain,
( ~ heap(sep(X3,sep(next(X1,X2),X4)))
| heap(sep(lseg(X1,X2),sep(X3,X4)))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_16,plain,
sep(X1,sep(X2,sep(X3,X4))) = sep(X3,sep(X2,sep(X1,X4))),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_17,hypothesis,
heap(sep(next(x1,x2),sep(lseg(x3,x1),sep(lseg(x4,nil),sep(next(x2,x4),emp))))),
premise_9 ).
cnf(c_0_18,hypothesis,
x1 != x2,
inference(fof_simplification,[status(thm)],[premise_5]) ).
cnf(c_0_19,negated_conjecture,
~ heap(sep(lseg(x4,nil),sep(next(x2,x4),sep(lseg(x3,x2),emp)))),
inference(fof_simplification,[status(thm)],[conclusion_1]) ).
cnf(c_0_20,plain,
( ~ heap(sep(lseg(X1,X6),sep(lseg(X6,X2),sep(X3,sep(next(X2,X4),X5)))))
| heap(sep(lseg(X1,X2),sep(X3,sep(next(X2,X4),X5)))) ),
inference(spm,[status(thm)],[c_0_14,c_0_10]) ).
cnf(c_0_21,plain,
( ~ heap(sep(X3,sep(X5,sep(X4,sep(next(X1,X2),X6)))))
| heap(sep(lseg(X1,X2),sep(X3,sep(X4,sep(X5,X6)))))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,hypothesis,
heap(sep(lseg(x4,nil),sep(lseg(x3,x1),sep(next(x2,x4),sep(next(x1,x2),emp))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_10]),c_0_10]),c_0_10]),c_0_10]) ).
cnf(c_0_23,hypothesis,
x1 != x2,
c_0_18 ).
cnf(c_0_24,negated_conjecture,
~ heap(sep(lseg(x4,nil),sep(next(x2,x4),sep(lseg(x3,x2),emp)))),
c_0_19 ).
cnf(c_0_25,plain,
( ~ heap(sep(X3,sep(lseg(X6,X2),sep(lseg(X1,X6),sep(next(X2,X4),X5)))))
| heap(sep(lseg(X1,X2),sep(X3,sep(next(X2,X4),X5)))) ),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_26,hypothesis,
heap(sep(lseg(x4,nil),sep(lseg(x1,x2),sep(lseg(x3,x1),sep(next(x2,x4),emp))))),
inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_10]),c_0_23]),c_0_10]) ).
cnf(c_0_27,negated_conjecture,
~ heap(sep(lseg(x4,nil),sep(lseg(x3,x2),sep(next(x2,x4),emp)))),
inference(spm,[status(thm)],[c_0_24,c_0_10]) ).
cnf(c_0_28,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_10]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWW407-1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.45 % Computer : n026.cluster.edu
% 0.17/0.45 % Model : x86_64 x86_64
% 0.17/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.45 % Memory : 8046.5625MB
% 0.17/0.45 % OS : Linux 6.8.0-71-generic
% 0.17/0.45 % CPULimit : 300
% 0.17/0.45 % WCLimit : 300
% 0.17/0.45 % DateTime : Mon Sep 21 09:54:22 UTC 2026
% 0.17/0.46 % CPUTime :
% 0.17/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.50 Running first-order theorem proving
% 0.17/0.50 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 13.18/2.52 % Version: 3.5.1
% 13.18/2.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 13.18/2.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.18/2.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 13.18/2.52 % Starting new_bool_3 with 300s (1) cores
% 13.18/2.52 % Starting new_bool_1 with 300s (1) cores
% 13.18/2.52 % Starting sh5l with 300s (1) cores
% 13.18/2.52 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1976494 completed with status 0
% 13.18/2.52 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 13.18/2.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 13.18/2.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.18/2.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 13.18/2.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 13.18/2.52 % No SInE strategy applied
% 13.18/2.52 % Search class: FGUSS-FFMF22-MFFFFFNN
% 13.18/2.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 13.18/2.52 % Starting SubtermCWHack with 136s (1) cores
% 13.18/2.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 13.18/2.52 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 203s (1) cores
% 13.18/2.52 % Starting new_bool_3 with 203s (1) cores
% 13.18/2.52 % Starting new_bool_1 with 203s (1) cores
% 13.18/2.52 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1976499 completed with status 0
% 13.18/2.52 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 13.18/2.52 % Preprocessing class: FSMSSMSSSSSNFFN.
% 13.18/2.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.18/2.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 13.18/2.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 13.18/2.52 % No SInE strategy applied
% 13.18/2.52 % Search class: FGUSS-FFMF22-MFFFFFNN
% 13.18/2.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 13.18/2.52 % Starting SubtermCWHack with 136s (1) cores
% 13.18/2.52 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 13.18/2.52 % Preprocessing time : 0.002 s
% 13.18/2.52 % Presaturation interreduction done
% 13.18/2.52
% 13.18/2.52 % Proof found!
% 13.18/2.52 % SZS status Unsatisfiable
% 13.18/2.52 % SZS output start CNFRefutation
% See solution above
% 13.18/2.52 % Parsed axioms : 21
% 13.18/2.52 % Removed by relevancy pruning/SinE : 0
% 13.18/2.52 % Initial clauses : 21
% 13.18/2.52 % Removed in clause preprocessing : 0
% 13.18/2.52 % Initial clauses in saturation : 21
% 13.18/2.52 % Processed clauses : 5985
% 13.18/2.52 % ...of these trivial : 34
% 13.18/2.52 % ...subsumed : 5658
% 13.18/2.52 % ...remaining for further processing : 292
% 13.18/2.52 % Other redundant clauses eliminated : 0
% 13.18/2.52 % Clauses deleted for lack of memory : 0
% 13.18/2.52 % Backward-subsumed : 2
% 13.18/2.52 % Backward-rewritten : 1
% 13.18/2.52 % Generated clauses : 43598
% 13.18/2.52 % ...of the previous two non-redundant : 43435
% 13.18/2.52 % ...aggressively subsumed : 0
% 13.18/2.52 % Contextual simplify-reflections : 0
% 13.18/2.52 % Paramodulations : 43598
% 13.18/2.52 % Factorizations : 0
% 13.18/2.52 % NegExts : 0
% 13.18/2.52 % Equation resolutions : 0
% 13.18/2.52 % Disequality decompositions : 0
% 13.18/2.52 % Total rewrite steps : 787
% 13.18/2.52 % ...of those cached : 628
% 13.18/2.52 % Propositional unsat checks : 0
% 13.18/2.52 % Propositional check models : 0
% 13.18/2.52 % Propositional check unsatisfiable : 0
% 13.18/2.52 % Propositional clauses : 0
% 13.18/2.52 % Propositional clauses after purity: 0
% 13.18/2.52 % Propositional unsat core size : 0
% 13.18/2.52 % Propositional preprocessing time : 0.000
% 13.18/2.52 % Propositional encoding time : 0.000
% 13.18/2.52 % Propositional solver time : 0.000
% 13.18/2.52 % Success case prop preproc time : 0.000
% 13.18/2.52 % Success case prop encoding time : 0.000
% 13.18/2.52 % Success case prop solver time : 0.000
% 13.18/2.52 % Current number of processed clauses : 268
% 13.18/2.52 % Positive orientable unit clauses : 10
% 13.18/2.52 % Positive unorientable unit clauses: 19
% 13.18/2.52 % Negative unit clauses : 37
% 13.18/2.52 % Non-unit-clauses : 202
% 13.18/2.52 % Current number of unprocessed clauses: 37483
% 13.18/2.52 % ...number of literals in the above : 77112
% 13.18/2.52 % Current number of archived formulas : 0
% 13.18/2.52 % Current number of archived clauses : 24
% 13.18/2.52 % Clause-clause subsumption calls (NU) : 36312
% 13.18/2.52 % Rec. Clause-clause subsumption calls : 36312
% 13.18/2.52 % Non-unit clause-clause subsumptions : 2860
% 13.18/2.52 % Unit Clause-clause subsumption calls : 157
% 13.18/2.52 % Rewrite failures with RHS unbound : 0
% 13.18/2.52 % BW rewrite match attempts : 4450
% 13.18/2.52 % BW rewrite match successes : 1504
% 13.18/2.52 % Condensation attempts : 0
% 13.18/2.52 % Condensation successes : 0
% 13.18/2.52 % Termbank termtop insertions : 708455
% 13.18/2.52 % Search garbage collected termcells : 43
% 13.18/2.52
% 13.18/2.52 % -------------------------------------------------
% 13.18/2.52 % User time : 1.798 s
% 13.18/2.52 % System time : 0.064 s
% 13.18/2.52 % Total time : 1.862 s
% 13.18/2.52 % Maximum resident set size: 3652 pages
% 13.18/2.52
% 13.18/2.52 % -------------------------------------------------
% 13.18/2.52 % User time : 8.741 s
% 13.18/2.52 % System time : 0.245 s
% 13.18/2.52 % Total time : 8.986 s
% 13.18/2.52 % Maximum resident set size: 4608 pages
% 13.18/2.52 % E exiting
%------------------------------------------------------------------------------