%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC373-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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 02:44:08 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.47s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of clauses : 33 ( 22 unt; 0 nHn; 31 RR)
% Number of literals : 66 ( 14 equ; 37 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 29 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause173,axiom,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause131,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause131) ).
cnf(co1_7,negated_conjecture,
rearsegP(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_8,negated_conjecture,
~ segmentP(sk2,sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_0_11,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
inference(fof_simplification,[status(thm)],[clause173]) ).
cnf(c_0_12,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_13,negated_conjecture,
rearsegP(sk4,sk3),
co1_7 ).
cnf(c_0_14,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_15,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_16,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_17,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
c_0_11 ).
cnf(c_0_18,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
c_0_12 ).
cnf(c_0_19,negated_conjecture,
rearsegP(sk4,sk1),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_21,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
~ segmentP(sk2,sk1),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(app(app(X1,X2),X3))
| segmentP(app(app(X1,X2),X3),X2) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
app(skaf46(sk4,sk1),sk1) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_25,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_27,negated_conjecture,
~ segmentP(sk2,sk1),
c_0_22 ).
cnf(c_0_28,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(app(sk4,X1))
| segmentP(app(sk4,X1),sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_20]),c_0_25])]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_26 ).
cnf(c_0_30,axiom,
ssList(nil),
clause8 ).
cnf(c_0_31,negated_conjecture,
~ segmentP(sk4,sk1),
inference(rw,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_21]),c_0_30])]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC373-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n005.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 08:19:47 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/0.42 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.14/0.47 % Version: 3.5.1
% 0.14/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.47 % Starting sh5l with 300s (1) cores
% 0.14/0.47 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3002605 completed with status 0
% 0.14/0.47 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.47 % No SInE strategy applied
% 0.14/0.47 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.14/0.47 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.47 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/0.47 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.14/0.47 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.14/0.47 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 3002614 completed with status 0
% 0.14/0.47 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.14/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.47 % No SInE strategy applied
% 0.14/0.47 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.14/0.47 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.47 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/0.47 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.14/0.47 % Preprocessing time : 0.003 s
% 0.14/0.47
% 0.14/0.47 % Proof found!
% 0.14/0.47 % SZS status Unsatisfiable
% 0.14/0.47 % SZS output start CNFRefutation
% See solution above
% 0.14/0.47 % Parsed axioms : 193
% 0.14/0.47 % Removed by relevancy pruning/SinE : 0
% 0.14/0.47 % Initial clauses : 193
% 0.14/0.47 % Removed in clause preprocessing : 0
% 0.14/0.47 % Initial clauses in saturation : 193
% 0.14/0.47 % Processed clauses : 274
% 0.14/0.47 % ...of these trivial : 2
% 0.14/0.47 % ...subsumed : 39
% 0.14/0.47 % ...remaining for further processing : 233
% 0.14/0.47 % Other redundant clauses eliminated : 75
% 0.14/0.47 % Clauses deleted for lack of memory : 0
% 0.14/0.47 % Backward-subsumed : 0
% 0.14/0.47 % Backward-rewritten : 0
% 0.14/0.47 % Generated clauses : 615
% 0.14/0.47 % ...of the previous two non-redundant : 492
% 0.14/0.47 % ...aggressively subsumed : 0
% 0.14/0.47 % Contextual simplify-reflections : 5
% 0.14/0.47 % Paramodulations : 536
% 0.14/0.47 % Factorizations : 0
% 0.14/0.47 % NegExts : 0
% 0.14/0.47 % Equation resolutions : 80
% 0.14/0.47 % Disequality decompositions : 0
% 0.14/0.47 % Total rewrite steps : 415
% 0.14/0.47 % ...of those cached : 356
% 0.14/0.47 % Propositional unsat checks : 0
% 0.14/0.47 % Propositional check models : 0
% 0.14/0.47 % Propositional check unsatisfiable : 0
% 0.14/0.47 % Propositional clauses : 0
% 0.14/0.47 % Propositional clauses after purity: 0
% 0.14/0.47 % Propositional unsat core size : 0
% 0.14/0.47 % Propositional preprocessing time : 0.000
% 0.14/0.47 % Propositional encoding time : 0.000
% 0.14/0.47 % Propositional solver time : 0.000
% 0.14/0.47 % Success case prop preproc time : 0.000
% 0.14/0.47 % Success case prop encoding time : 0.000
% 0.14/0.47 % Success case prop solver time : 0.000
% 0.14/0.47 % Current number of processed clauses : 210
% 0.14/0.47 % Positive orientable unit clauses : 63
% 0.14/0.47 % Positive unorientable unit clauses: 0
% 0.14/0.47 % Negative unit clauses : 3
% 0.14/0.47 % Non-unit-clauses : 144
% 0.14/0.47 % Current number of unprocessed clauses: 411
% 0.14/0.47 % ...number of literals in the above : 2080
% 0.14/0.47 % Current number of archived formulas : 0
% 0.14/0.47 % Current number of archived clauses : 0
% 0.14/0.47 % Clause-clause subsumption calls (NU) : 5568
% 0.14/0.47 % Rec. Clause-clause subsumption calls : 1013
% 0.14/0.47 % Non-unit clause-clause subsumptions : 33
% 0.14/0.47 % Unit Clause-clause subsumption calls : 4
% 0.14/0.47 % Rewrite failures with RHS unbound : 0
% 0.14/0.47 % BW rewrite match attempts : 0
% 0.14/0.47 % BW rewrite match successes : 0
% 0.14/0.47 % Condensation attempts : 0
% 0.14/0.47 % Condensation successes : 0
% 0.14/0.47 % Termbank termtop insertions : 18345
% 0.14/0.47 % Search garbage collected termcells : 529
% 0.14/0.47
% 0.14/0.47 % -------------------------------------------------
% 0.14/0.47 % User time : 0.029 s
% 0.14/0.47 % System time : 0.006 s
% 0.14/0.47 % Total time : 0.034 s
% 0.14/0.47 % Maximum resident set size: 4012 pages
% 0.14/0.47
% 0.14/0.47 % -------------------------------------------------
% 0.14/0.47 % User time : 0.149 s
% 0.14/0.47 % System time : 0.021 s
% 0.14/0.47 % Total time : 0.170 s
% 0.14/0.47 % Maximum resident set size: 4864 pages
% 0.14/0.47 % E exiting
%------------------------------------------------------------------------------