%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC122-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:43:06 PM UTC 2026
% Result : Unsatisfiable 0.29s 0.69s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of clauses : 42 ( 21 unt; 0 nHn; 40 RR)
% Number of literals : 85 ( 14 equ; 48 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 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(co1_11,negated_conjecture,
( ~ neq(sk4,nil)
| rearsegP(sk4,sk3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause173,axiom,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SWC001-0.ax',clause131) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_9,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_10,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_0_13,negated_conjecture,
( ~ neq(sk4,nil)
| rearsegP(sk4,sk3) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_14,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_15,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_16,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_17,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_18,negated_conjecture,
( ~ neq(sk4,nil)
| rearsegP(sk4,sk3) ),
c_0_13 ).
cnf(c_0_19,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_20,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_22,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_23,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_24,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
c_0_16 ).
cnf(c_0_25,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
c_0_17 ).
cnf(c_0_26,negated_conjecture,
rearsegP(sk4,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_27,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_28,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_21,c_0_15]) ).
cnf(c_0_29,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
c_0_22 ).
cnf(c_0_30,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
c_0_23 ).
cnf(c_0_31,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_24]) ).
cnf(c_0_32,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_25,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_33,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_35,negated_conjecture,
( ~ segmentP(sk4,sk1)
| ~ neq(sk1,nil) ),
inference(rw,[status(thm)],[c_0_29,c_0_15]) ).
cnf(c_0_36,negated_conjecture,
neq(sk1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_19]),c_0_20])]) ).
cnf(c_0_37,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_31,c_0_32]),c_0_27]),c_0_33])]) ).
cnf(c_0_38,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_34 ).
cnf(c_0_39,axiom,
ssList(nil),
clause8 ).
cnf(c_0_40,negated_conjecture,
~ segmentP(sk4,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]) ).
cnf(c_0_41,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_37,c_0_38]),c_0_28]),c_0_39])]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC122-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n001.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 08:02:59 UTC 2026
% 0.20/0.47 % CPUTime :
% 0.20/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.56 Running first-order theorem proving
% 0.24/0.56 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
% 0.29/0.69 % Version: 3.5.1
% 0.29/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.29/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.29/0.69 % Starting new_bool_3 with 300s (1) cores
% 0.29/0.69 % Starting new_bool_1 with 300s (1) cores
% 0.29/0.69 % Starting sh5l with 300s (1) cores
% 0.29/0.69 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2623180 completed with status 0
% 0.29/0.69 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.29/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.29/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.29/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.29/0.69 % No SInE strategy applied
% 0.29/0.69 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.29/0.69 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.29/0.69 % Starting SubtermCWHack with 136s (1) cores
% 0.29/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.29/0.69 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.29/0.69 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.29/0.69 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.29/0.69 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 2623188 completed with status 0
% 0.29/0.69 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.29/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.29/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.29/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.29/0.69 % No SInE strategy applied
% 0.29/0.69 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.29/0.69 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.29/0.69 % Starting SubtermCWHack with 136s (1) cores
% 0.29/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.29/0.69 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.29/0.69 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.29/0.69 % Preprocessing time : 0.005 s
% 0.29/0.69
% 0.29/0.69 % Proof found!
% 0.29/0.69 % SZS status Unsatisfiable
% 0.29/0.69 % SZS output start CNFRefutation
% See solution above
% 0.29/0.69 % Parsed axioms : 196
% 0.29/0.69 % Removed by relevancy pruning/SinE : 0
% 0.29/0.69 % Initial clauses : 196
% 0.29/0.69 % Removed in clause preprocessing : 0
% 0.29/0.69 % Initial clauses in saturation : 196
% 0.29/0.69 % Processed clauses : 329
% 0.29/0.69 % ...of these trivial : 2
% 0.29/0.69 % ...subsumed : 67
% 0.29/0.69 % ...remaining for further processing : 260
% 0.29/0.69 % Other redundant clauses eliminated : 78
% 0.29/0.69 % Clauses deleted for lack of memory : 0
% 0.29/0.69 % Backward-subsumed : 0
% 0.29/0.69 % Backward-rewritten : 4
% 0.29/0.69 % Generated clauses : 802
% 0.29/0.69 % ...of the previous two non-redundant : 663
% 0.29/0.69 % ...aggressively subsumed : 0
% 0.29/0.69 % Contextual simplify-reflections : 8
% 0.29/0.69 % Paramodulations : 720
% 0.29/0.69 % Factorizations : 0
% 0.29/0.69 % NegExts : 0
% 0.29/0.69 % Equation resolutions : 83
% 0.29/0.69 % Disequality decompositions : 0
% 0.29/0.69 % Total rewrite steps : 677
% 0.29/0.69 % ...of those cached : 611
% 0.29/0.69 % Propositional unsat checks : 0
% 0.29/0.69 % Propositional check models : 0
% 0.29/0.69 % Propositional check unsatisfiable : 0
% 0.29/0.69 % Propositional clauses : 0
% 0.29/0.69 % Propositional clauses after purity: 0
% 0.29/0.69 % Propositional unsat core size : 0
% 0.29/0.69 % Propositional preprocessing time : 0.000
% 0.29/0.69 % Propositional encoding time : 0.000
% 0.29/0.69 % Propositional solver time : 0.000
% 0.29/0.69 % Success case prop preproc time : 0.000
% 0.29/0.69 % Success case prop encoding time : 0.000
% 0.29/0.69 % Success case prop solver time : 0.000
% 0.29/0.69 % Current number of processed clauses : 233
% 0.29/0.69 % Positive orientable unit clauses : 67
% 0.29/0.69 % Positive unorientable unit clauses: 0
% 0.29/0.69 % Negative unit clauses : 3
% 0.29/0.69 % Non-unit-clauses : 163
% 0.29/0.69 % Current number of unprocessed clauses: 519
% 0.29/0.69 % ...number of literals in the above : 2852
% 0.29/0.69 % Current number of archived formulas : 0
% 0.29/0.69 % Current number of archived clauses : 4
% 0.29/0.69 % Clause-clause subsumption calls (NU) : 7270
% 0.29/0.69 % Rec. Clause-clause subsumption calls : 1169
% 0.29/0.69 % Non-unit clause-clause subsumptions : 54
% 0.29/0.69 % Unit Clause-clause subsumption calls : 12
% 0.29/0.69 % Rewrite failures with RHS unbound : 0
% 0.29/0.69 % BW rewrite match attempts : 3
% 0.29/0.69 % BW rewrite match successes : 3
% 0.29/0.69 % Condensation attempts : 0
% 0.29/0.69 % Condensation successes : 0
% 0.29/0.69 % Termbank termtop insertions : 22359
% 0.29/0.69 % Search garbage collected termcells : 539
% 0.29/0.69
% 0.29/0.69 % -------------------------------------------------
% 0.29/0.69 % User time : 0.057 s
% 0.29/0.69 % System time : 0.008 s
% 0.29/0.69 % Total time : 0.065 s
% 0.29/0.69 % Maximum resident set size: 4064 pages
% 0.29/0.69
% 0.29/0.69 % -------------------------------------------------
% 0.29/0.69 % User time : 0.213 s
% 0.29/0.69 % System time : 0.034 s
% 0.29/0.69 % Total time : 0.247 s
% 0.29/0.69 % Maximum resident set size: 4864 pages
% 0.29/0.69 % E exiting
%------------------------------------------------------------------------------