%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC008-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 : n003.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:35 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.46s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 30 ( 19 unt; 0 nHn; 28 RR)
% Number of literals : 59 ( 21 equ; 35 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 26 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_9,negated_conjecture,
( app(X1,X3) != sk1
| app(app(X1,X2),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
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(co1_7,negated_conjecture,
frontsegP(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
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(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(c_0_10,negated_conjecture,
( app(X1,X3) != sk1
| app(app(X1,X2),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_11,negated_conjecture,
( app(X1,X3) != sk1
| app(app(X1,X2),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_10 ).
cnf(c_0_12,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_13,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_14,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_15,negated_conjecture,
frontsegP(sk4,sk3),
co1_7 ).
cnf(c_0_16,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_17,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_18,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(X1,X3) != sk1
| app(app(X1,X2),X3) != sk4 ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_19,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_13 ).
cnf(c_0_20,axiom,
ssList(nil),
clause8 ).
cnf(c_0_21,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_22,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
c_0_14 ).
cnf(c_0_23,negated_conjecture,
frontsegP(sk4,sk1),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_25,negated_conjecture,
( ~ ssList(X1)
| app(app(sk1,X1),nil) != sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[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_26,negated_conjecture,
app(sk1,skaf45(sk4,sk1)) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_21]),c_0_24])]) ).
cnf(c_0_27,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_28,negated_conjecture,
app(sk4,nil) != sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_19]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC008-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n003.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 07:50:31 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.14/0.46 % Version: 3.5.1
% 0.14/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.46 % Starting sh5l with 300s (1) cores
% 0.14/0.46 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3784343 completed with status 0
% 0.14/0.46 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.46 % No SInE strategy applied
% 0.14/0.46 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.14/0.46 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.46 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/0.46 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.14/0.46 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.14/0.46 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 3784352 completed with status 0
% 0.14/0.46 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.14/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.46 % No SInE strategy applied
% 0.14/0.46 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.14/0.46 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.46 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/0.46 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.14/0.46 % Preprocessing time : 0.003 s
% 0.14/0.46
% 0.14/0.46 % Proof found!
% 0.14/0.46 % SZS status Unsatisfiable
% 0.14/0.46 % SZS output start CNFRefutation
% See solution above
% 0.14/0.46 % Parsed axioms : 195
% 0.14/0.46 % Removed by relevancy pruning/SinE : 0
% 0.14/0.46 % Initial clauses : 195
% 0.14/0.46 % Removed in clause preprocessing : 0
% 0.14/0.46 % Initial clauses in saturation : 195
% 0.14/0.46 % Processed clauses : 218
% 0.14/0.46 % ...of these trivial : 2
% 0.14/0.46 % ...subsumed : 8
% 0.14/0.46 % ...remaining for further processing : 208
% 0.14/0.46 % Other redundant clauses eliminated : 67
% 0.14/0.46 % Clauses deleted for lack of memory : 0
% 0.14/0.46 % Backward-subsumed : 0
% 0.14/0.46 % Backward-rewritten : 0
% 0.14/0.46 % Generated clauses : 449
% 0.14/0.46 % ...of the previous two non-redundant : 357
% 0.14/0.46 % ...aggressively subsumed : 0
% 0.14/0.46 % Contextual simplify-reflections : 0
% 0.14/0.46 % Paramodulations : 378
% 0.14/0.46 % Factorizations : 0
% 0.14/0.46 % NegExts : 0
% 0.14/0.46 % Equation resolutions : 72
% 0.14/0.46 % Disequality decompositions : 0
% 0.14/0.46 % Total rewrite steps : 290
% 0.14/0.46 % ...of those cached : 233
% 0.14/0.46 % Propositional unsat checks : 0
% 0.14/0.46 % Propositional check models : 0
% 0.14/0.46 % Propositional check unsatisfiable : 0
% 0.14/0.46 % Propositional clauses : 0
% 0.14/0.46 % Propositional clauses after purity: 0
% 0.14/0.46 % Propositional unsat core size : 0
% 0.14/0.46 % Propositional preprocessing time : 0.000
% 0.14/0.46 % Propositional encoding time : 0.000
% 0.14/0.46 % Propositional solver time : 0.000
% 0.14/0.46 % Success case prop preproc time : 0.000
% 0.14/0.46 % Success case prop encoding time : 0.000
% 0.14/0.46 % Success case prop solver time : 0.000
% 0.14/0.46 % Current number of processed clauses : 185
% 0.14/0.46 % Positive orientable unit clauses : 60
% 0.14/0.46 % Positive unorientable unit clauses: 0
% 0.14/0.46 % Negative unit clauses : 6
% 0.14/0.46 % Non-unit-clauses : 119
% 0.14/0.46 % Current number of unprocessed clauses: 334
% 0.14/0.46 % ...number of literals in the above : 1638
% 0.14/0.46 % Current number of archived formulas : 0
% 0.14/0.46 % Current number of archived clauses : 0
% 0.14/0.46 % Clause-clause subsumption calls (NU) : 4352
% 0.14/0.46 % Rec. Clause-clause subsumption calls : 575
% 0.14/0.46 % Non-unit clause-clause subsumptions : 4
% 0.14/0.46 % Unit Clause-clause subsumption calls : 59
% 0.14/0.46 % Rewrite failures with RHS unbound : 0
% 0.14/0.46 % BW rewrite match attempts : 0
% 0.14/0.46 % BW rewrite match successes : 0
% 0.14/0.46 % Condensation attempts : 0
% 0.14/0.46 % Condensation successes : 0
% 0.14/0.46 % Termbank termtop insertions : 15486
% 0.14/0.46 % Search garbage collected termcells : 546
% 0.14/0.46
% 0.14/0.46 % -------------------------------------------------
% 0.14/0.46 % User time : 0.024 s
% 0.14/0.46 % System time : 0.006 s
% 0.14/0.46 % Total time : 0.029 s
% 0.14/0.46 % Maximum resident set size: 4068 pages
% 0.14/0.46
% 0.14/0.46 % -------------------------------------------------
% 0.14/0.46 % User time : 0.109 s
% 0.14/0.46 % System time : 0.028 s
% 0.14/0.46 % Total time : 0.137 s
% 0.14/0.46 % Maximum resident set size: 5120 pages
% 0.14/0.46 % E exiting
%------------------------------------------------------------------------------