%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWW431-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 : n002.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:40 PM UTC 2026
% Result : Unsatisfiable 0.15s 10.62s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 18 ( 14 unt; 4 nHn; 13 RR)
% Number of literals : 26 ( 17 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 14 ( 3 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 13 con; 0-2 aty)
% Number of variables : 31 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wellformedness_5,axiom,
( ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4)))
| X1 = X3
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV013-0.ax',wellformedness_5) ).
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(premise_13,hypothesis,
heap(sep(lseg(x5,x3),sep(lseg(x10,x8),sep(lseg(x13,x8),sep(lseg(x1,x11),sep(lseg(x4,x9),sep(lseg(x2,x9),sep(lseg(x12,x7),sep(lseg(x9,x2),sep(lseg(x7,x10),sep(lseg(x11,x12),sep(lseg(x11,x7),sep(lseg(x11,x1),emp))))))))))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_13) ).
cnf(premise_7,hypothesis,
x7 != x11,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_7) ).
cnf(normalization,axiom,
sep(lseg(X1,X1),X2) = X2,
file('/export/starexec/sandbox/benchmark/Axioms/SWV013-0.ax',normalization) ).
cnf(c_0_5,plain,
( ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4)))
| X1 = X3
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[wellformedness_5]) ).
cnf(c_0_6,axiom,
sep(X1,sep(X2,X3)) = sep(X2,sep(X1,X3)),
associative_commutative ).
cnf(c_0_7,plain,
( ~ heap(sep(lseg(X1,X2),sep(lseg(X1,X3),X4)))
| X1 = X3
| X1 = X2 ),
c_0_5 ).
cnf(c_0_8,plain,
sep(X1,sep(X2,sep(X3,X4))) = sep(X3,sep(X1,sep(X2,X4))),
inference(spm,[status(thm)],[c_0_6,c_0_6]) ).
cnf(c_0_9,hypothesis,
heap(sep(lseg(x5,x3),sep(lseg(x10,x8),sep(lseg(x13,x8),sep(lseg(x1,x11),sep(lseg(x4,x9),sep(lseg(x2,x9),sep(lseg(x12,x7),sep(lseg(x9,x2),sep(lseg(x7,x10),sep(lseg(x11,x12),sep(lseg(x11,x7),sep(lseg(x11,x1),emp))))))))))))),
premise_13 ).
cnf(c_0_10,hypothesis,
x7 != x11,
inference(fof_simplification,[status(thm)],[premise_7]) ).
cnf(c_0_11,plain,
( ~ heap(sep(X4,sep(lseg(X1,X3),sep(lseg(X1,X2),X5))))
| X1 = X3
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,hypothesis,
heap(sep(lseg(x7,x10),sep(lseg(x11,x7),sep(lseg(x11,x12),sep(lseg(x11,x1),sep(lseg(x2,x9),sep(lseg(x9,x2),sep(lseg(x5,x3),sep(lseg(x10,x8),sep(lseg(x12,x7),sep(lseg(x13,x8),sep(lseg(x1,x11),sep(lseg(x4,x9),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)],[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(spm,[status(thm)],[c_0_9,c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]) ).
cnf(c_0_13,hypothesis,
x7 != x11,
c_0_10 ).
cnf(c_0_14,hypothesis,
x12 = x11,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_15,axiom,
sep(lseg(X1,X1),X2) = X2,
normalization ).
cnf(c_0_16,hypothesis,
heap(sep(lseg(x7,x10),sep(lseg(x11,x7),sep(lseg(x11,x7),sep(lseg(x11,x1),sep(lseg(x2,x9),sep(lseg(x9,x2),sep(lseg(x5,x3),sep(lseg(x10,x8),sep(lseg(x13,x8),sep(lseg(x1,x11),sep(lseg(x4,x9),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)],[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_9,c_0_14]),c_0_15]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]),c_0_6]) ).
cnf(c_0_17,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_16]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW431-1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/10.54 % Computer : n002.cluster.edu
% 0.10/10.54 % Model : x86_64 x86_64
% 0.10/10.54 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.54 % Memory : 8046.5625MB
% 0.10/10.54 % OS : Linux 6.8.0-71-generic
% 0.10/10.54 % CPULimit : 300
% 0.10/10.54 % WCLimit : 300
% 0.10/10.54 % DateTime : Mon Sep 21 09:56:01 UTC 2026
% 0.10/10.54 % CPUTime :
% 0.10/10.54 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/10.59 Running first-order theorem proving
% 0.10/10.59 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
% 0.15/10.62 % Version: 3.5.1
% 0.15/10.62 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/10.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/10.62 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.62 % Starting new_bool_1 with 300s (1) cores
% 0.15/10.62 % Starting sh5l with 300s (1) cores
% 0.15/10.62 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 3010466 completed with status 0
% 0.15/10.62 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.15/10.62 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/10.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/10.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/10.62 % No SInE strategy applied
% 0.15/10.62 % Search class: FGUSS-FFMF22-DFFFFFNN
% 0.15/10.62 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/10.62 % Starting SubtermCWHack with 136s (1) cores
% 0.15/10.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/10.62 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 303s (1) cores
% 0.15/10.62 % Starting new_bool_3 with 298s (1) cores
% 0.15/10.62 % Starting new_bool_1 with 291s (1) cores
% 0.15/10.62 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 3010473 completed with status 0
% 0.15/10.62 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.15/10.62 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/10.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/10.62 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/10.62 % No SInE strategy applied
% 0.15/10.62 % Search class: FGUSS-FFMF22-DFFFFFNN
% 0.15/10.62 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/10.62 % Starting SubtermCWHack with 136s (1) cores
% 0.15/10.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.15/10.62 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 303s (1) cores
% 0.15/10.62 % Preprocessing time : 0.002 s
% 0.15/10.62
% 0.15/10.62 % Proof found!
% 0.15/10.62 % SZS status Unsatisfiable
% 0.15/10.62 % SZS output start CNFRefutation
% See solution above
% 0.15/10.62 % Parsed axioms : 25
% 0.15/10.62 % Removed by relevancy pruning/SinE : 0
% 0.15/10.62 % Initial clauses : 25
% 0.15/10.62 % Removed in clause preprocessing : 1
% 0.15/10.62 % Initial clauses in saturation : 24
% 0.15/10.62 % Processed clauses : 103
% 0.15/10.62 % ...of these trivial : 13
% 0.15/10.62 % ...subsumed : 49
% 0.15/10.62 % ...remaining for further processing : 41
% 0.15/10.62 % Other redundant clauses eliminated : 6
% 0.15/10.62 % Clauses deleted for lack of memory : 0
% 0.15/10.62 % Backward-subsumed : 0
% 0.15/10.62 % Backward-rewritten : 1
% 0.15/10.62 % Generated clauses : 342
% 0.15/10.62 % ...of the previous two non-redundant : 305
% 0.15/10.62 % ...aggressively subsumed : 0
% 0.15/10.62 % Contextual simplify-reflections : 0
% 0.15/10.62 % Paramodulations : 312
% 0.15/10.62 % Factorizations : 24
% 0.15/10.62 % NegExts : 0
% 0.15/10.62 % Equation resolutions : 6
% 0.15/10.62 % Disequality decompositions : 0
% 0.15/10.62 % Total rewrite steps : 813
% 0.15/10.62 % ...of those cached : 658
% 0.15/10.62 % Propositional unsat checks : 0
% 0.15/10.62 % Propositional check models : 0
% 0.15/10.62 % Propositional check unsatisfiable : 0
% 0.15/10.62 % Propositional clauses : 0
% 0.15/10.62 % Propositional clauses after purity: 0
% 0.15/10.62 % Propositional unsat core size : 0
% 0.15/10.62 % Propositional preprocessing time : 0.000
% 0.15/10.62 % Propositional encoding time : 0.000
% 0.15/10.62 % Propositional solver time : 0.000
% 0.15/10.62 % Success case prop preproc time : 0.000
% 0.15/10.62 % Success case prop encoding time : 0.000
% 0.15/10.62 % Success case prop solver time : 0.000
% 0.15/10.62 % Current number of processed clauses : 40
% 0.15/10.62 % Positive orientable unit clauses : 5
% 0.15/10.62 % Positive unorientable unit clauses: 2
% 0.15/10.62 % Negative unit clauses : 20
% 0.15/10.62 % Non-unit-clauses : 13
% 0.15/10.62 % Current number of unprocessed clauses: 226
% 0.15/10.62 % ...number of literals in the above : 423
% 0.15/10.62 % Current number of archived formulas : 0
% 0.15/10.62 % Current number of archived clauses : 1
% 0.15/10.62 % Clause-clause subsumption calls (NU) : 93
% 0.15/10.62 % Rec. Clause-clause subsumption calls : 93
% 0.15/10.62 % Non-unit clause-clause subsumptions : 12
% 0.15/10.62 % Unit Clause-clause subsumption calls : 87
% 0.15/10.62 % Rewrite failures with RHS unbound : 0
% 0.15/10.62 % BW rewrite match attempts : 34
% 0.15/10.62 % BW rewrite match successes : 15
% 0.15/10.62 % Condensation attempts : 0
% 0.15/10.62 % Condensation successes : 0
% 0.15/10.62 % Termbank termtop insertions : 5899
% 0.15/10.62 % Search garbage collected termcells : 52
% 0.15/10.62
% 0.15/10.62 % -------------------------------------------------
% 0.15/10.62 % User time : 0.013 s
% 0.15/10.62 % System time : 0.005 s
% 0.15/10.62 % Total time : 0.018 s
% 0.15/10.62 % Maximum resident set size: 3668 pages
% 0.15/10.62
% 0.15/10.62 % -------------------------------------------------
% 0.15/10.62 % User time : 0.071 s
% 0.15/10.62 % System time : 0.016 s
% 0.15/10.62 % Total time : 0.088 s
% 0.15/10.62 % Maximum resident set size: 4608 pages
% 0.15/10.62 % E exiting
%------------------------------------------------------------------------------