%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC058-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 : n010.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:42:48 PM UTC 2026
% Result : Unsatisfiable 0.24s 0.67s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of clauses : 59 ( 18 unt; 10 nHn; 57 RR)
% Number of literals : 148 ( 47 equ; 83 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 : 49 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
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_14,negated_conjecture,
( rearsegP(sk4,sk3)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
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_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_11,negated_conjecture,
( neq(sk3,nil)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
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(clause119,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_9,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(c_0_16,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = sk2 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_17,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_18,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_19,negated_conjecture,
( rearsegP(sk4,sk3)
| nil = sk3 ),
co1_14 ).
cnf(c_0_20,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_21,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_22,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_23,negated_conjecture,
( ~ segmentP(sk1,X1)
| ~ segmentP(sk2,X1)
| ~ neq(X1,nil)
| ~ ssList(X1)
| nil = sk2 ),
c_0_16 ).
cnf(c_0_24,negated_conjecture,
( neq(sk3,nil)
| nil = sk4 ),
co1_11 ).
cnf(c_0_25,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
c_0_17 ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
c_0_18 ).
cnf(c_0_27,negated_conjecture,
( rearsegP(sk4,sk1)
| nil = sk1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_20]) ).
cnf(c_0_28,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_29,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ segmentP(sk1,X1)
| ~ neq(X1,nil)
| nil = sk4 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_22]),c_0_22]) ).
cnf(c_0_31,negated_conjecture,
( neq(sk1,nil)
| nil = sk4 ),
inference(rw,[status(thm)],[c_0_24,c_0_20]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_33,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_25]) ).
cnf(c_0_34,negated_conjecture,
( nil = sk1
| app(skaf46(sk4,sk1),sk1) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]) ).
cnf(c_0_35,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_36,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_38,negated_conjecture,
( ~ segmentP(sk4,sk1)
| ~ segmentP(sk1,sk1)
| nil = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_28])]) ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_32 ).
cnf(c_0_40,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(app(sk4,X1))
| segmentP(app(sk4,X1),sk1)
| nil = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_28]),c_0_35])]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_36 ).
cnf(c_0_42,axiom,
ssList(nil),
clause8 ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
c_0_37 ).
cnf(c_0_44,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_46,negated_conjecture,
( ~ segmentP(sk4,sk1)
| nil = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_28])]) ).
cnf(c_0_47,negated_conjecture,
( segmentP(sk4,sk1)
| nil = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_29]),c_0_42])]) ).
cnf(c_0_48,negated_conjecture,
( nil != sk4
| nil = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_34]),c_0_28]),c_0_35])]) ).
cnf(c_0_49,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
c_0_44 ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_45 ).
cnf(c_0_51,negated_conjecture,
nil = sk1,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).
cnf(c_0_52,negated_conjecture,
( nil != sk1
| neq(sk4,nil) ),
inference(rw,[status(thm)],[c_0_49,c_0_22]) ).
cnf(c_0_53,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_50]) ).
cnf(c_0_54,negated_conjecture,
( neq(sk1,sk1)
| sk4 = sk1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_51]),c_0_51]) ).
cnf(c_0_55,negated_conjecture,
neq(sk4,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_51]),c_0_51])]) ).
cnf(c_0_56,negated_conjecture,
sk4 = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_28])]) ).
cnf(c_0_57,negated_conjecture,
neq(sk1,sk1),
inference(rw,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_57]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC058-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.47 % Computer : n010.cluster.edu
% 0.20/0.47 % Model : x86_64 x86_64
% 0.20/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.47 % Memory : 8046.5625MB
% 0.20/0.47 % OS : Linux 6.8.0-71-generic
% 0.20/0.47 % CPULimit : 300
% 0.20/0.47 % WCLimit : 300
% 0.20/0.47 % DateTime : Mon Sep 21 07:52:25 UTC 2026
% 0.20/0.48 % CPUTime :
% 0.20/0.48 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.54 Running first-order theorem proving
% 0.24/0.54 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.24/0.67 % Version: 3.5.1
% 0.24/0.67 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.67 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.67 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.67 % Starting sh5l with 300s (1) cores
% 0.24/0.67 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 408495 completed with status 0
% 0.24/0.67 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.24/0.67 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.67 % No SInE strategy applied
% 0.24/0.67 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.24/0.67 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.67 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.24/0.67 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.24/0.67 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.24/0.67 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.24/0.67 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 408504 completed with status 0
% 0.24/0.67 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.24/0.67 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.67 % No SInE strategy applied
% 0.24/0.67 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.24/0.67 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.67 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.24/0.67 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.24/0.67 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.24/0.67 % Preprocessing time : 0.005 s
% 0.24/0.67
% 0.24/0.67 % Proof found!
% 0.24/0.67 % SZS status Unsatisfiable
% 0.24/0.67 % SZS output start CNFRefutation
% See solution above
% 0.24/0.67 % Parsed axioms : 199
% 0.24/0.67 % Removed by relevancy pruning/SinE : 0
% 0.24/0.67 % Initial clauses : 199
% 0.24/0.67 % Removed in clause preprocessing : 0
% 0.24/0.67 % Initial clauses in saturation : 199
% 0.24/0.67 % Processed clauses : 479
% 0.24/0.67 % ...of these trivial : 4
% 0.24/0.67 % ...subsumed : 131
% 0.24/0.67 % ...remaining for further processing : 344
% 0.24/0.67 % Other redundant clauses eliminated : 88
% 0.24/0.67 % Clauses deleted for lack of memory : 0
% 0.24/0.67 % Backward-subsumed : 2
% 0.24/0.67 % Backward-rewritten : 137
% 0.24/0.67 % Generated clauses : 1147
% 0.24/0.67 % ...of the previous two non-redundant : 1078
% 0.24/0.67 % ...aggressively subsumed : 0
% 0.24/0.67 % Contextual simplify-reflections : 18
% 0.24/0.67 % Paramodulations : 1053
% 0.24/0.67 % Factorizations : 0
% 0.24/0.67 % NegExts : 0
% 0.24/0.67 % Equation resolutions : 95
% 0.24/0.67 % Disequality decompositions : 0
% 0.24/0.67 % Total rewrite steps : 1265
% 0.24/0.67 % ...of those cached : 1186
% 0.24/0.67 % Propositional unsat checks : 0
% 0.24/0.67 % Propositional check models : 0
% 0.24/0.67 % Propositional check unsatisfiable : 0
% 0.24/0.67 % Propositional clauses : 0
% 0.24/0.67 % Propositional clauses after purity: 0
% 0.24/0.67 % Propositional unsat core size : 0
% 0.24/0.67 % Propositional preprocessing time : 0.000
% 0.24/0.67 % Propositional encoding time : 0.000
% 0.24/0.67 % Propositional solver time : 0.000
% 0.24/0.67 % Success case prop preproc time : 0.000
% 0.24/0.67 % Success case prop encoding time : 0.000
% 0.24/0.67 % Success case prop solver time : 0.000
% 0.24/0.67 % Current number of processed clauses : 182
% 0.24/0.67 % Positive orientable unit clauses : 52
% 0.24/0.67 % Positive unorientable unit clauses: 0
% 0.24/0.67 % Negative unit clauses : 2
% 0.24/0.67 % Non-unit-clauses : 128
% 0.24/0.67 % Current number of unprocessed clauses: 783
% 0.24/0.67 % ...number of literals in the above : 4301
% 0.24/0.67 % Current number of archived formulas : 0
% 0.24/0.67 % Current number of archived clauses : 139
% 0.24/0.67 % Clause-clause subsumption calls (NU) : 11234
% 0.24/0.67 % Rec. Clause-clause subsumption calls : 2152
% 0.24/0.67 % Non-unit clause-clause subsumptions : 117
% 0.24/0.67 % Unit Clause-clause subsumption calls : 23
% 0.24/0.67 % Rewrite failures with RHS unbound : 0
% 0.24/0.67 % BW rewrite match attempts : 4
% 0.24/0.67 % BW rewrite match successes : 4
% 0.24/0.67 % Condensation attempts : 0
% 0.24/0.67 % Condensation successes : 0
% 0.24/0.67 % Termbank termtop insertions : 29587
% 0.24/0.67 % Search garbage collected termcells : 544
% 0.24/0.67
% 0.24/0.67 % -------------------------------------------------
% 0.24/0.67 % User time : 0.081 s
% 0.24/0.67 % System time : 0.007 s
% 0.24/0.67 % Total time : 0.088 s
% 0.24/0.67 % Maximum resident set size: 4068 pages
% 0.24/0.67
% 0.24/0.67 % -------------------------------------------------
% 0.24/0.67 % User time : 0.323 s
% 0.24/0.67 % System time : 0.031 s
% 0.24/0.67 % Total time : 0.354 s
% 0.24/0.67 % Maximum resident set size: 5120 pages
% 0.24/0.67 % E exiting
%------------------------------------------------------------------------------