%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC221-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 : n011.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:31 PM UTC 2026
% Result : Unsatisfiable 0.60s 0.63s
% Output : CNFRefutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 39 ( 12 unt; 3 nHn; 35 RR)
% Number of literals : 102 ( 28 equ; 71 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 54 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause71,axiom,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(co1_9,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| memberP(X2,sk5(X3,X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_8,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ssItem(sk5(X3,X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause109,axiom,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(co1_7,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(c_0_12,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_13,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| memberP(X2,sk5(X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_14,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
c_0_12 ).
cnf(c_0_15,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| memberP(X2,sk5(X3,X2,X1)) ),
c_0_13 ).
cnf(c_0_16,axiom,
ssList(nil),
clause8 ).
cnf(c_0_17,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ssItem(sk5(X3,X2,X1)) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_18,negated_conjecture,
( ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(sk5(X2,nil,X1))
| app(app(nil,cons(X1,nil)),X2) != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_19,negated_conjecture,
( app(app(X2,cons(X1,nil)),X3) != sk1
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ssItem(sk5(X3,X2,X1)) ),
c_0_17 ).
cnf(c_0_20,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_21,negated_conjecture,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(app(nil,cons(X1,nil)),X2) != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_16])]) ).
cnf(c_0_22,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_20 ).
cnf(c_0_23,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_24,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| app(cons(X1,nil),X2) != sk1 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_23 ).
cnf(c_0_26,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_27,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| cons(X1,X2) != sk1 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_26 ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_30,negated_conjecture,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_16])]) ).
cnf(c_0_31,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
c_0_29 ).
cnf(c_0_32,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_33,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_34,negated_conjecture,
nil != sk1,
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_35,negated_conjecture,
( ~ ssList(X1)
| X1 != sk1
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33])]) ).
cnf(c_0_36,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_37,negated_conjecture,
nil != sk1,
c_0_34 ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC221-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n011.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 08:05:55 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.40 Running first-order theorem proving
% 0.08/0.40 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.60/0.63 % Version: 3.5.1
% 0.60/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.60/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.60/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.60/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.60/0.63 % Starting sh5l with 300s (1) cores
% 0.60/0.63 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1418546 completed with status 0
% 0.60/0.63 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.60/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.60/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.60/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.60/0.63 % No SInE strategy applied
% 0.60/0.63 % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.60/0.63 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.60/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.60/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.60/0.63 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.60/0.63 % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.60/0.63 % Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.60/0.63 % G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with pid 1418557 completed with status 0
% 0.60/0.63 % Result found by G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y
% 0.60/0.63 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.60/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.60/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.60/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.60/0.63 % No SInE strategy applied
% 0.60/0.63 % Search class: FGHSM-FSLM31-MFFFFFNN
% 0.60/0.63 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.60/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.60/0.63 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.60/0.63 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.60/0.63 % Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.60/0.63 % Preprocessing time : 0.003 s
% 0.60/0.63 % Presaturation interreduction done
% 0.60/0.63
% 0.60/0.63 % Proof found!
% 0.60/0.63 % SZS status Unsatisfiable
% 0.60/0.63 % SZS output start CNFRefutation
% See solution above
% 0.60/0.63 % Parsed axioms : 202
% 0.60/0.63 % Removed by relevancy pruning/SinE : 0
% 0.60/0.63 % Initial clauses : 202
% 0.60/0.63 % Removed in clause preprocessing : 0
% 0.60/0.63 % Initial clauses in saturation : 202
% 0.60/0.63 % Processed clauses : 1068
% 0.60/0.63 % ...of these trivial : 7
% 0.60/0.63 % ...subsumed : 316
% 0.60/0.63 % ...remaining for further processing : 745
% 0.60/0.63 % Other redundant clauses eliminated : 84
% 0.60/0.63 % Clauses deleted for lack of memory : 0
% 0.60/0.63 % Backward-subsumed : 45
% 0.60/0.63 % Backward-rewritten : 14
% 0.60/0.63 % Generated clauses : 3321
% 0.60/0.63 % ...of the previous two non-redundant : 3060
% 0.60/0.63 % ...aggressively subsumed : 0
% 0.60/0.63 % Contextual simplify-reflections : 25
% 0.60/0.63 % Paramodulations : 3218
% 0.60/0.63 % Factorizations : 0
% 0.60/0.63 % NegExts : 0
% 0.60/0.63 % Equation resolutions : 103
% 0.60/0.63 % Disequality decompositions : 0
% 0.60/0.63 % Total rewrite steps : 2244
% 0.60/0.63 % ...of those cached : 2114
% 0.60/0.63 % Propositional unsat checks : 0
% 0.60/0.63 % Propositional check models : 0
% 0.60/0.63 % Propositional check unsatisfiable : 0
% 0.60/0.63 % Propositional clauses : 0
% 0.60/0.63 % Propositional clauses after purity: 0
% 0.60/0.63 % Propositional unsat core size : 0
% 0.60/0.63 % Propositional preprocessing time : 0.000
% 0.60/0.63 % Propositional encoding time : 0.000
% 0.60/0.63 % Propositional solver time : 0.000
% 0.60/0.63 % Success case prop preproc time : 0.000
% 0.60/0.63 % Success case prop encoding time : 0.000
% 0.60/0.63 % Success case prop solver time : 0.000
% 0.60/0.63 % Current number of processed clauses : 485
% 0.60/0.63 % Positive orientable unit clauses : 63
% 0.60/0.63 % Positive unorientable unit clauses: 0
% 0.60/0.63 % Negative unit clauses : 5
% 0.60/0.63 % Non-unit-clauses : 417
% 0.60/0.63 % Current number of unprocessed clauses: 2317
% 0.60/0.63 % ...number of literals in the above : 13103
% 0.60/0.63 % Current number of archived formulas : 0
% 0.60/0.63 % Current number of archived clauses : 255
% 0.60/0.63 % Clause-clause subsumption calls (NU) : 41292
% 0.60/0.63 % Rec. Clause-clause subsumption calls : 8816
% 0.60/0.63 % Non-unit clause-clause subsumptions : 303
% 0.60/0.63 % Unit Clause-clause subsumption calls : 77
% 0.60/0.63 % Rewrite failures with RHS unbound : 0
% 0.60/0.63 % BW rewrite match attempts : 3
% 0.60/0.63 % BW rewrite match successes : 3
% 0.60/0.63 % Condensation attempts : 0
% 0.60/0.63 % Condensation successes : 0
% 0.60/0.63 % Termbank termtop insertions : 65150
% 0.60/0.63 % Search garbage collected termcells : 563
% 0.60/0.63
% 0.60/0.63 % -------------------------------------------------
% 0.60/0.63 % User time : 0.170 s
% 0.60/0.63 % System time : 0.013 s
% 0.60/0.63 % Total time : 0.183 s
% 0.60/0.63 % Maximum resident set size: 4072 pages
% 0.60/0.63
% 0.60/0.63 % -------------------------------------------------
% 0.60/0.63 % User time : 0.745 s
% 0.60/0.63 % System time : 0.053 s
% 0.60/0.63 % Total time : 0.799 s
% 0.60/0.63 % Maximum resident set size: 5120 pages
% 0.60/0.63 % E exiting
%------------------------------------------------------------------------------