%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC030-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 : n012.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:41 PM UTC 2026
% Result : Unsatisfiable 0.04s 0.77s
% Output : CNFRefutation 0.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of clauses : 50 ( 23 unt; 2 nHn; 50 RR)
% Number of literals : 98 ( 67 equ; 50 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause119,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(co1_10,negated_conjecture,
app(sk6,sk5) = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_9,negated_conjecture,
app(sk5,sk6) = sk4,
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(co1_7,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_8,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(co1_14,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_11,negated_conjecture,
( nil = sk1
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause118,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause145,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause145) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_0_14,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_15,negated_conjecture,
app(sk6,sk5) = sk3,
co1_10 ).
cnf(c_0_16,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_17,negated_conjecture,
app(sk5,sk6) = sk4,
co1_9 ).
cnf(c_0_18,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_19,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
c_0_14 ).
cnf(c_0_20,negated_conjecture,
app(sk6,sk5) = sk1,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
ssList(sk5),
co1_7 ).
cnf(c_0_22,negated_conjecture,
ssList(sk6),
co1_8 ).
cnf(c_0_23,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_24,negated_conjecture,
app(sk5,sk6) = sk2,
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
( sk1 != nil
| sk5 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_23 ).
cnf(c_0_28,negated_conjecture,
( sk1 != nil
| app(nil,sk6) = sk2 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_26 ).
cnf(c_0_30,negated_conjecture,
( sk1 != nil
| app(sk6,nil) = sk1 ),
inference(spm,[status(thm)],[c_0_20,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( nil != sk2
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_32,negated_conjecture,
( sk1 != nil
| sk6 = sk2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_22])]) ).
cnf(c_0_33,negated_conjecture,
( sk1 != nil
| sk6 = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_22])]) ).
cnf(c_0_34,negated_conjecture,
( nil != sk2
| nil != sk1 ),
c_0_31 ).
cnf(c_0_35,negated_conjecture,
( sk1 != nil
| sk2 = sk1 ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
( nil = sk1
| nil = sk2 ),
co1_11 ).
cnf(c_0_37,negated_conjecture,
sk1 != nil,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,negated_conjecture,
( sk2 != nil
| sk6 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_24]),c_0_22]),c_0_21])]) ).
cnf(c_0_39,negated_conjecture,
sk2 = nil,
inference(sr,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_41,negated_conjecture,
sk6 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_40 ).
cnf(c_0_44,negated_conjecture,
app(sk5,nil) = nil,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_39]),c_0_41]) ).
cnf(c_0_45,axiom,
ssList(nil),
clause8 ).
cnf(c_0_46,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
c_0_42 ).
cnf(c_0_47,negated_conjecture,
sk5 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_21])]) ).
cnf(c_0_48,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_46])]),c_0_45])]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_41]),c_0_47]),c_0_48]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC030-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.72 % Computer : n012.cluster.edu
% 0.04/0.72 % Model : x86_64 x86_64
% 0.04/0.72 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.72 % Memory : 8046.5625MB
% 0.04/0.72 % OS : Linux 6.8.0-71-generic
% 0.04/0.72 % CPULimit : 300
% 0.04/0.72 % WCLimit : 300
% 0.04/0.72 % DateTime : Mon Sep 21 07:49:55 UTC 2026
% 0.04/0.73 % CPUTime :
% 0.04/0.73 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.75 Running first-order theorem proving
% 0.04/0.75 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.04/0.77 % Version: 3.5.1
% 0.04/0.77 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.04/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/0.77 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.04/0.77 % Starting new_bool_3 with 300s (1) cores
% 0.04/0.77 % Starting new_bool_1 with 300s (1) cores
% 0.04/0.77 % Starting sh5l with 300s (1) cores
% 0.04/0.77 % new_bool_3 with pid 1922469 completed with status 0
% 0.04/0.77 % Result found by new_bool_3
% 0.04/0.77 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.04/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/0.77 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.04/0.77 % Starting new_bool_3 with 300s (1) cores
% 0.04/0.77 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.04/0.77 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.04/0.77 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.04/0.77 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.04/0.77 % Starting SubtermCWHack with 31s (1) cores
% 0.04/0.77 % SubtermCWHack with pid 1922472 completed with status 0
% 0.04/0.77 % Result found by SubtermCWHack
% 0.04/0.77 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.04/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/0.77 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.04/0.77 % Starting new_bool_3 with 300s (1) cores
% 0.04/0.77 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.04/0.77 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.04/0.77 % Search class: FGHSF-FFMM22-SFFFFFNN
% 0.04/0.77 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.04/0.77 % Starting SubtermCWHack with 31s (1) cores
% 0.04/0.77 % Preprocessing time : 0.001 s
% 0.04/0.77
% 0.04/0.77 % Proof found!
% 0.04/0.77 % SZS status Unsatisfiable
% 0.04/0.77 % SZS output start CNFRefutation
% See solution above
% 0.04/0.77 % Parsed axioms : 199
% 0.04/0.77 % Removed by relevancy pruning/SinE : 168
% 0.04/0.77 % Initial clauses : 31
% 0.04/0.77 % Removed in clause preprocessing : 2
% 0.04/0.77 % Initial clauses in saturation : 29
% 0.04/0.77 % Processed clauses : 37
% 0.04/0.77 % ...of these trivial : 0
% 0.04/0.77 % ...subsumed : 0
% 0.04/0.77 % ...remaining for further processing : 36
% 0.04/0.77 % Other redundant clauses eliminated : 2
% 0.04/0.77 % Clauses deleted for lack of memory : 0
% 0.04/0.77 % Backward-subsumed : 7
% 0.04/0.77 % Backward-rewritten : 10
% 0.04/0.77 % Generated clauses : 45
% 0.04/0.77 % ...of the previous two non-redundant : 27
% 0.04/0.77 % ...aggressively subsumed : 0
% 0.04/0.77 % Contextual simplify-reflections : 0
% 0.04/0.77 % Paramodulations : 43
% 0.04/0.77 % Factorizations : 0
% 0.04/0.77 % NegExts : 0
% 0.04/0.77 % Equation resolutions : 2
% 0.04/0.77 % Disequality decompositions : 0
% 0.04/0.77 % Total rewrite steps : 62
% 0.04/0.77 % ...of those cached : 51
% 0.04/0.77 % Propositional unsat checks : 0
% 0.04/0.77 % Propositional check models : 0
% 0.04/0.77 % Propositional check unsatisfiable : 0
% 0.04/0.77 % Propositional clauses : 0
% 0.04/0.77 % Propositional clauses after purity: 0
% 0.04/0.77 % Propositional unsat core size : 0
% 0.04/0.77 % Propositional preprocessing time : 0.000
% 0.04/0.77 % Propositional encoding time : 0.000
% 0.04/0.77 % Propositional solver time : 0.000
% 0.04/0.77 % Success case prop preproc time : 0.000
% 0.04/0.77 % Success case prop encoding time : 0.000
% 0.04/0.77 % Success case prop solver time : 0.000
% 0.04/0.77 % Current number of processed clauses : 17
% 0.04/0.77 % Positive orientable unit clauses : 8
% 0.04/0.77 % Positive unorientable unit clauses: 0
% 0.04/0.77 % Negative unit clauses : 1
% 0.04/0.77 % Non-unit-clauses : 8
% 0.04/0.77 % Current number of unprocessed clauses: 18
% 0.04/0.77 % ...number of literals in the above : 56
% 0.04/0.77 % Current number of archived formulas : 0
% 0.04/0.77 % Current number of archived clauses : 18
% 0.04/0.77 % Clause-clause subsumption calls (NU) : 35
% 0.04/0.77 % Rec. Clause-clause subsumption calls : 24
% 0.04/0.77 % Non-unit clause-clause subsumptions : 0
% 0.04/0.77 % Unit Clause-clause subsumption calls : 7
% 0.04/0.77 % Rewrite failures with RHS unbound : 0
% 0.04/0.77 % BW rewrite match attempts : 5
% 0.04/0.77 % BW rewrite match successes : 5
% 0.04/0.77 % Condensation attempts : 0
% 0.04/0.77 % Condensation successes : 0
% 0.04/0.77 % Termbank termtop insertions : 2975
% 0.04/0.77 % Search garbage collected termcells : 926
% 0.04/0.77
% 0.04/0.77 % -------------------------------------------------
% 0.04/0.77 % User time : 0.004 s
% 0.04/0.77 % System time : 0.001 s
% 0.04/0.77 % Total time : 0.005 s
% 0.04/0.77 % Maximum resident set size: 3812 pages
% 0.04/0.77
% 0.04/0.77 % -------------------------------------------------
% 0.04/0.77 % User time : 0.009 s
% 0.04/0.77 % System time : 0.002 s
% 0.04/0.77 % Total time : 0.010 s
% 0.04/0.77 % Maximum resident set size: 4864 pages
% 0.04/0.77 % E exiting
%------------------------------------------------------------------------------