%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC191-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 : n013.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:24 PM UTC 2026
% Result : Unsatisfiable 0.50s 0.56s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of clauses : 50 ( 28 unt; 0 nHn; 50 RR)
% Number of literals : 114 ( 34 equ; 67 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(co1_14,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_12,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(co1_10,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_11,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
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(co1_13,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause157,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause180,axiom,
( ~ ssList(X5)
| ~ equalelemsP(X5)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X4)
| app(X1,cons(X2,cons(X3,X4))) != X5
| X2 = X3 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause180) ).
cnf(co1_8,negated_conjecture,
equalelemsP(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_15,negated_conjecture,
sk5 != sk6,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(c_0_15,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_16,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
co1_14 ).
cnf(c_0_17,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_15 ).
cnf(c_0_18,negated_conjecture,
ssList(sk7),
co1_12 ).
cnf(c_0_19,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_20,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,nil))
| app(app(sk7,app(cons(sk5,nil),cons(sk6,nil))),sk8) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_21,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_19 ).
cnf(c_0_22,negated_conjecture,
ssItem(sk5),
co1_10 ).
cnf(c_0_23,axiom,
ssList(nil),
clause8 ).
cnf(c_0_24,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| app(app(sk7,app(cons(sk5,nil),cons(sk6,nil))),sk8) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_25,negated_conjecture,
ssItem(sk6),
co1_11 ).
cnf(c_0_26,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_27,negated_conjecture,
app(app(sk7,app(cons(sk5,nil),cons(sk6,nil))),sk8) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_21]),c_0_25]),c_0_23])]) ).
cnf(c_0_28,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_26 ).
cnf(c_0_29,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| app(app(sk7,cons(sk5,cons(sk6,nil))),sk8) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_22])]) ).
cnf(c_0_30,negated_conjecture,
app(app(sk7,cons(sk5,cons(sk6,nil))),sk8) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_21]),c_0_25]),c_0_23])]) ).
cnf(c_0_31,negated_conjecture,
ssList(sk8),
co1_13 ).
cnf(c_0_32,negated_conjecture,
( ~ ssList(cons(sk5,cons(sk6,nil)))
| app(sk7,app(cons(sk5,cons(sk6,nil)),sk8)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_30]),c_0_18]),c_0_31])]) ).
cnf(c_0_33,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| app(sk7,app(cons(sk5,cons(sk6,nil)),sk8)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_21]),c_0_22])]) ).
cnf(c_0_34,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_35,negated_conjecture,
app(sk7,app(cons(sk5,cons(sk6,nil)),sk8)) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_21]),c_0_25]),c_0_23])]) ).
cnf(c_0_36,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_34 ).
cnf(c_0_37,plain,
( ~ ssList(X5)
| ~ equalelemsP(X5)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X4)
| app(X1,cons(X2,cons(X3,X4))) != X5
| X2 = X3 ),
inference(fof_simplification,[status(thm)],[clause180]) ).
cnf(c_0_38,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| app(sk7,cons(sk5,app(cons(sk6,nil),sk8))) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_22]),c_0_31])]) ).
cnf(c_0_39,plain,
( ~ ssList(X5)
| ~ equalelemsP(X5)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X4)
| app(X1,cons(X2,cons(X3,X4))) != X5
| X2 = X3 ),
c_0_37 ).
cnf(c_0_40,negated_conjecture,
app(sk7,cons(sk5,app(cons(sk6,nil),sk8))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_21]),c_0_25]),c_0_23])]) ).
cnf(c_0_41,negated_conjecture,
equalelemsP(sk3),
co1_8 ).
cnf(c_0_42,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_43,negated_conjecture,
sk5 != sk6,
inference(fof_simplification,[status(thm)],[co1_15]) ).
cnf(c_0_44,plain,
( ~ equalelemsP(app(X3,cons(X1,cons(X2,X4))))
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(app(X3,cons(X1,cons(X2,X4))))
| ~ ssItem(X1)
| ~ ssItem(X2)
| X1 = X2 ),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_45,negated_conjecture,
app(sk7,cons(sk5,cons(sk6,sk8))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_28]),c_0_25]),c_0_31])]) ).
cnf(c_0_46,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_47,negated_conjecture,
equalelemsP(sk1),
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,negated_conjecture,
sk5 != sk6,
c_0_43 ).
cnf(c_0_49,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_25]),c_0_22]),c_0_46]),c_0_31]),c_0_18]),c_0_47])]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC191-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n013.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 08:02:21 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.50/0.56 % Version: 3.5.1
% 0.50/0.56 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.50/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.50/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.50/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.50/0.56 % Starting sh5l with 300s (1) cores
% 0.50/0.56 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 321752 completed with status 0
% 0.50/0.56 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.50/0.56 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.50/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.50/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.50/0.56 % No SInE strategy applied
% 0.50/0.56 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.50/0.56 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.50/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.50/0.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.50/0.56 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.50/0.56 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.50/0.56 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.50/0.56 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 321761 completed with status 0
% 0.50/0.56 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.50/0.56 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.50/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.50/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.50/0.56 % No SInE strategy applied
% 0.50/0.56 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.50/0.56 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.50/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.50/0.56 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.50/0.56 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.50/0.56 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.50/0.56 % Preprocessing time : 0.006 s
% 0.50/0.56
% 0.50/0.56 % Proof found!
% 0.50/0.56 % SZS status Unsatisfiable
% 0.50/0.56 % SZS output start CNFRefutation
% See solution above
% 0.50/0.56 % Parsed axioms : 200
% 0.50/0.56 % Removed by relevancy pruning/SinE : 0
% 0.50/0.56 % Initial clauses : 200
% 0.50/0.56 % Removed in clause preprocessing : 0
% 0.50/0.56 % Initial clauses in saturation : 200
% 0.50/0.56 % Processed clauses : 326
% 0.50/0.56 % ...of these trivial : 2
% 0.50/0.56 % ...subsumed : 31
% 0.50/0.56 % ...remaining for further processing : 293
% 0.50/0.56 % Other redundant clauses eliminated : 58
% 0.50/0.56 % Clauses deleted for lack of memory : 0
% 0.50/0.56 % Backward-subsumed : 5
% 0.50/0.56 % Backward-rewritten : 14
% 0.50/0.56 % Generated clauses : 860
% 0.50/0.56 % ...of the previous two non-redundant : 748
% 0.50/0.56 % ...aggressively subsumed : 0
% 0.50/0.56 % Contextual simplify-reflections : 14
% 0.50/0.56 % Paramodulations : 798
% 0.50/0.56 % Factorizations : 0
% 0.50/0.56 % NegExts : 0
% 0.50/0.56 % Equation resolutions : 63
% 0.50/0.56 % Disequality decompositions : 0
% 0.50/0.56 % Total rewrite steps : 881
% 0.50/0.56 % ...of those cached : 792
% 0.50/0.56 % Propositional unsat checks : 0
% 0.50/0.56 % Propositional check models : 0
% 0.50/0.56 % Propositional check unsatisfiable : 0
% 0.50/0.56 % Propositional clauses : 0
% 0.50/0.56 % Propositional clauses after purity: 0
% 0.50/0.56 % Propositional unsat core size : 0
% 0.50/0.56 % Propositional preprocessing time : 0.000
% 0.50/0.56 % Propositional encoding time : 0.000
% 0.50/0.56 % Propositional solver time : 0.000
% 0.50/0.56 % Success case prop preproc time : 0.000
% 0.50/0.56 % Success case prop encoding time : 0.000
% 0.50/0.56 % Success case prop solver time : 0.000
% 0.50/0.56 % Current number of processed clauses : 251
% 0.50/0.56 % Positive orientable unit clauses : 78
% 0.50/0.56 % Positive unorientable unit clauses: 0
% 0.50/0.56 % Negative unit clauses : 3
% 0.50/0.56 % Non-unit-clauses : 170
% 0.50/0.56 % Current number of unprocessed clauses: 600
% 0.50/0.56 % ...number of literals in the above : 3292
% 0.50/0.56 % Current number of archived formulas : 0
% 0.50/0.56 % Current number of archived clauses : 19
% 0.50/0.56 % Clause-clause subsumption calls (NU) : 10502
% 0.50/0.56 % Rec. Clause-clause subsumption calls : 1906
% 0.50/0.56 % Non-unit clause-clause subsumptions : 36
% 0.50/0.56 % Unit Clause-clause subsumption calls : 28
% 0.50/0.56 % Rewrite failures with RHS unbound : 0
% 0.50/0.56 % BW rewrite match attempts : 11
% 0.50/0.56 % BW rewrite match successes : 9
% 0.50/0.56 % Condensation attempts : 0
% 0.50/0.56 % Condensation successes : 0
% 0.50/0.56 % Termbank termtop insertions : 25782
% 0.50/0.56 % Search garbage collected termcells : 540
% 0.50/0.56
% 0.50/0.56 % -------------------------------------------------
% 0.50/0.56 % User time : 0.070 s
% 0.50/0.56 % System time : 0.012 s
% 0.50/0.56 % Total time : 0.082 s
% 0.50/0.56 % Maximum resident set size: 4068 pages
% 0.50/0.56
% 0.50/0.56 % -------------------------------------------------
% 0.50/0.56 % User time : 0.274 s
% 0.50/0.56 % System time : 0.042 s
% 0.50/0.56 % Total time : 0.316 s
% 0.50/0.56 % Maximum resident set size: 5120 pages
% 0.50/0.56 % E exiting
%------------------------------------------------------------------------------