%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC357-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 : n009.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:04 PM UTC 2026
% Result : Unsatisfiable 1.03s 0.69s
% Output : CNFRefutation 1.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 44 ( 22 unt; 2 nHn; 42 RR)
% Number of literals : 99 ( 17 equ; 59 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 : 42 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause172,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_8,negated_conjecture,
~ segmentP(sk2,sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause79,axiom,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause79) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
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_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause132,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(co1_12,negated_conjecture,
( frontsegP(sk4,sk3)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
cnf(c_0_13,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
inference(fof_simplification,[status(thm)],[clause172]) ).
cnf(c_0_14,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_15,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
c_0_13 ).
cnf(c_0_16,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_14 ).
cnf(c_0_17,axiom,
ssList(nil),
clause8 ).
cnf(c_0_18,negated_conjecture,
~ segmentP(sk2,sk1),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_19,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ segmentP(X1,X3)
| segmentP(app(X1,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause79]) ).
cnf(c_0_21,negated_conjecture,
~ segmentP(sk2,sk1),
c_0_18 ).
cnf(c_0_22,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_23,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_24,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(nil,X2)
| segmentP(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_16]),c_0_17])]) ).
cnf(c_0_25,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
c_0_20 ).
cnf(c_0_26,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_27,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_29,negated_conjecture,
~ segmentP(sk4,sk3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_30,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != X2
| segmentP(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_26,c_0_22]) ).
cnf(c_0_32,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_27,c_0_23]) ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
c_0_28 ).
cnf(c_0_34,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_35,negated_conjecture,
( frontsegP(sk4,sk3)
| nil = sk3 ),
co1_12 ).
cnf(c_0_36,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ segmentP(X3,X2)
| ~ frontsegP(X1,X3)
| segmentP(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_33]),c_0_34])]) ).
cnf(c_0_38,negated_conjecture,
frontsegP(sk4,sk3),
inference(sr,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(sk3,X1)
| segmentP(sk4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_32]),c_0_31])]) ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_41,negated_conjecture,
~ segmentP(sk3,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_39]),c_0_32])]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_40 ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC357-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.45 % Computer : n009.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Mon Sep 21 08:18:27 UTC 2026
% 0.20/0.45 % CPUTime :
% 0.20/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.53 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
% 1.03/0.69 % Version: 3.5.1
% 1.03/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.03/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.03/0.69 % Starting new_bool_3 with 300s (1) cores
% 1.03/0.69 % Starting new_bool_1 with 300s (1) cores
% 1.03/0.69 % Starting sh5l with 300s (1) cores
% 1.03/0.69 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1295500 completed with status 0
% 1.03/0.69 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.03/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.03/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.03/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.03/0.69 % No SInE strategy applied
% 1.03/0.69 % Search class: FGHSM-FSLM21-MFFFFFNN
% 1.03/0.69 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.03/0.69 % Starting SubtermCWHack with 136s (1) cores
% 1.03/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.03/0.69 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 1.03/0.69 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1.03/0.69 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1.03/0.69 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 1295508 completed with status 0
% 1.03/0.69 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 1.03/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.03/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.03/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.03/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.03/0.69 % No SInE strategy applied
% 1.03/0.69 % Search class: FGHSM-FSLM21-MFFFFFNN
% 1.03/0.69 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.03/0.69 % Starting SubtermCWHack with 136s (1) cores
% 1.03/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.03/0.69 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 1.03/0.69 % Preprocessing time : 0.003 s
% 1.03/0.69 % Presaturation interreduction done
% 1.03/0.69
% 1.03/0.69 % Proof found!
% 1.03/0.69 % SZS status Unsatisfiable
% 1.03/0.69 % SZS output start CNFRefutation
% See solution above
% 1.03/0.69 % Parsed axioms : 197
% 1.03/0.69 % Removed by relevancy pruning/SinE : 0
% 1.03/0.69 % Initial clauses : 197
% 1.03/0.69 % Removed in clause preprocessing : 0
% 1.03/0.69 % Initial clauses in saturation : 197
% 1.03/0.69 % Processed clauses : 1286
% 1.03/0.69 % ...of these trivial : 84
% 1.03/0.69 % ...subsumed : 499
% 1.03/0.69 % ...remaining for further processing : 703
% 1.03/0.69 % Other redundant clauses eliminated : 129
% 1.03/0.69 % Clauses deleted for lack of memory : 0
% 1.03/0.69 % Backward-subsumed : 68
% 1.03/0.69 % Backward-rewritten : 8
% 1.03/0.69 % Generated clauses : 4435
% 1.03/0.69 % ...of the previous two non-redundant : 3855
% 1.03/0.69 % ...aggressively subsumed : 0
% 1.03/0.69 % Contextual simplify-reflections : 94
% 1.03/0.69 % Paramodulations : 4248
% 1.03/0.69 % Factorizations : 0
% 1.03/0.69 % NegExts : 0
% 1.03/0.69 % Equation resolutions : 159
% 1.03/0.69 % Disequality decompositions : 0
% 1.03/0.69 % Total rewrite steps : 3147
% 1.03/0.69 % ...of those cached : 2965
% 1.03/0.69 % Propositional unsat checks : 0
% 1.03/0.69 % Propositional check models : 0
% 1.03/0.69 % Propositional check unsatisfiable : 0
% 1.03/0.69 % Propositional clauses : 0
% 1.03/0.69 % Propositional clauses after purity: 0
% 1.03/0.69 % Propositional unsat core size : 0
% 1.03/0.69 % Propositional preprocessing time : 0.000
% 1.03/0.69 % Propositional encoding time : 0.000
% 1.03/0.69 % Propositional solver time : 0.000
% 1.03/0.69 % Success case prop preproc time : 0.000
% 1.03/0.69 % Success case prop encoding time : 0.000
% 1.03/0.69 % Success case prop solver time : 0.000
% 1.03/0.69 % Current number of processed clauses : 408
% 1.03/0.69 % Positive orientable unit clauses : 71
% 1.03/0.69 % Positive unorientable unit clauses: 0
% 1.03/0.69 % Negative unit clauses : 14
% 1.03/0.69 % Non-unit-clauses : 323
% 1.03/0.69 % Current number of unprocessed clauses: 2751
% 1.03/0.69 % ...number of literals in the above : 18500
% 1.03/0.69 % Current number of archived formulas : 0
% 1.03/0.69 % Current number of archived clauses : 286
% 1.03/0.69 % Clause-clause subsumption calls (NU) : 36092
% 1.03/0.69 % Rec. Clause-clause subsumption calls : 6267
% 1.03/0.69 % Non-unit clause-clause subsumptions : 512
% 1.03/0.69 % Unit Clause-clause subsumption calls : 2275
% 1.03/0.69 % Rewrite failures with RHS unbound : 0
% 1.03/0.69 % BW rewrite match attempts : 5
% 1.03/0.69 % BW rewrite match successes : 5
% 1.03/0.69 % Condensation attempts : 0
% 1.03/0.69 % Condensation successes : 0
% 1.03/0.69 % Termbank termtop insertions : 84579
% 1.03/0.69 % Search garbage collected termcells : 529
% 1.03/0.69
% 1.03/0.69 % -------------------------------------------------
% 1.03/0.69 % User time : 0.124 s
% 1.03/0.69 % System time : 0.010 s
% 1.03/0.69 % Total time : 0.134 s
% 1.03/0.69 % Maximum resident set size: 4064 pages
% 1.03/0.69
% 1.03/0.69 % -------------------------------------------------
% 1.03/0.69 % User time : 0.607 s
% 1.03/0.69 % System time : 0.050 s
% 1.03/0.69 % Total time : 0.657 s
% 1.03/0.69 % Maximum resident set size: 5120 pages
% 1.03/0.69 % E exiting
%------------------------------------------------------------------------------