%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC010-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 : n017.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:36 PM UTC 2026
% Result : Unsatisfiable 0.18s 5.71s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 9
% Syntax : Number of clauses : 33 ( 13 unt; 1 nHn; 33 RR)
% Number of literals : 68 ( 20 equ; 38 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_16,negated_conjecture,
( ~ neq(sk4,nil)
| app(X2,X3) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_20,negated_conjecture,
( ~ neq(sk4,nil)
| app(app(sk6,cons(sk5,nil)),sk7) = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_20) ).
cnf(co1_21,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,sk7) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_21) ).
cnf(co1_17,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_19,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_19) ).
cnf(co1_18,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(c_0_9,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_10,negated_conjecture,
( ~ neq(sk4,nil)
| app(X2,X3) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_11,negated_conjecture,
neq(sk2,nil),
c_0_9 ).
cnf(c_0_12,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_13,negated_conjecture,
( ~ neq(sk4,nil)
| app(app(sk6,cons(sk5,nil)),sk7) = sk4 ),
inference(fof_simplification,[status(thm)],[co1_20]) ).
cnf(c_0_14,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,sk7) = sk3 ),
inference(fof_simplification,[status(thm)],[co1_21]) ).
cnf(c_0_15,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_16,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk7) ),
inference(fof_simplification,[status(thm)],[co1_19]) ).
cnf(c_0_17,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
inference(fof_simplification,[status(thm)],[co1_18]) ).
cnf(c_0_18,negated_conjecture,
( ~ neq(sk4,nil)
| app(X2,X3) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
c_0_10 ).
cnf(c_0_19,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_20,negated_conjecture,
( ~ neq(sk4,nil)
| app(app(sk6,cons(sk5,nil)),sk7) = sk4 ),
c_0_13 ).
cnf(c_0_21,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk6,sk7) = sk3 ),
c_0_14 ).
cnf(c_0_22,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_23,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
c_0_15 ).
cnf(c_0_24,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk7) ),
c_0_16 ).
cnf(c_0_25,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk6) ),
c_0_17 ).
cnf(c_0_26,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2)
| app(X1,X3) != sk1
| app(app(X1,cons(X2,nil)),X3) != sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_12]),c_0_19])]) ).
cnf(c_0_27,negated_conjecture,
app(app(sk6,cons(sk5,nil)),sk7) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_19])]) ).
cnf(c_0_28,negated_conjecture,
app(sk6,sk7) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_19])]) ).
cnf(c_0_29,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_19])]) ).
cnf(c_0_30,negated_conjecture,
ssList(sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_19])]) ).
cnf(c_0_31,negated_conjecture,
ssList(sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_19])]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]),c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC010-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.14/5.62 % Computer : n017.cluster.edu
% 0.14/5.62 % Model : x86_64 x86_64
% 0.14/5.62 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/5.62 % Memory : 8046.5625MB
% 0.14/5.62 % OS : Linux 6.8.0-71-generic
% 0.14/5.62 % CPULimit : 300
% 0.14/5.62 % WCLimit : 300
% 0.14/5.62 % DateTime : Mon Sep 21 07:44:34 UTC 2026
% 0.14/5.62 % CPUTime :
% 0.14/5.63 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.67 Running first-order theorem proving
% 0.14/5.67 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.18/5.71 % Version: 3.5.1
% 0.18/5.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/5.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/5.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/5.71 % Starting new_bool_3 with 300s (1) cores
% 0.18/5.71 % Starting new_bool_1 with 300s (1) cores
% 0.18/5.71 % Starting sh5l with 300s (1) cores
% 0.18/5.71 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1812116 completed with status 0
% 0.18/5.71 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.18/5.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/5.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/5.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/5.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/5.71 % No SInE strategy applied
% 0.18/5.71 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.18/5.71 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/5.71 % Starting SubtermCWHack with 136s (1) cores
% 0.18/5.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.18/5.71 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.18/5.71 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.18/5.71 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.18/5.71 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 1812127 completed with status 0
% 0.18/5.71 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.18/5.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.18/5.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/5.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.18/5.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.18/5.71 % No SInE strategy applied
% 0.18/5.71 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.18/5.71 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.18/5.71 % Starting SubtermCWHack with 136s (1) cores
% 0.18/5.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.18/5.71 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.18/5.71 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.18/5.71 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.18/5.71 % Preprocessing time : 0.006 s
% 0.18/5.71
% 0.18/5.71 % Proof found!
% 0.18/5.71 % SZS status Unsatisfiable
% 0.18/5.71 % SZS output start CNFRefutation
% See solution above
% 0.18/5.71 % Parsed axioms : 207
% 0.18/5.71 % Removed by relevancy pruning/SinE : 0
% 0.18/5.71 % Initial clauses : 207
% 0.18/5.71 % Removed in clause preprocessing : 0
% 0.18/5.71 % Initial clauses in saturation : 207
% 0.18/5.71 % Processed clauses : 64
% 0.18/5.71 % ...of these trivial : 8
% 0.18/5.71 % ...subsumed : 0
% 0.18/5.71 % ...remaining for further processing : 56
% 0.18/5.71 % Other redundant clauses eliminated : 2
% 0.18/5.71 % Clauses deleted for lack of memory : 0
% 0.18/5.71 % Backward-subsumed : 0
% 0.18/5.71 % Backward-rewritten : 0
% 0.18/5.71 % Generated clauses : 30
% 0.18/5.71 % ...of the previous two non-redundant : 28
% 0.18/5.71 % ...aggressively subsumed : 0
% 0.18/5.71 % Contextual simplify-reflections : 0
% 0.18/5.71 % Paramodulations : 28
% 0.18/5.71 % Factorizations : 0
% 0.18/5.71 % NegExts : 0
% 0.18/5.71 % Equation resolutions : 2
% 0.18/5.71 % Disequality decompositions : 0
% 0.18/5.71 % Total rewrite steps : 40
% 0.18/5.71 % ...of those cached : 29
% 0.18/5.71 % Propositional unsat checks : 0
% 0.18/5.71 % Propositional check models : 0
% 0.18/5.71 % Propositional check unsatisfiable : 0
% 0.18/5.71 % Propositional clauses : 0
% 0.18/5.71 % Propositional clauses after purity: 0
% 0.18/5.71 % Propositional unsat core size : 0
% 0.18/5.71 % Propositional preprocessing time : 0.000
% 0.18/5.71 % Propositional encoding time : 0.000
% 0.18/5.71 % Propositional solver time : 0.000
% 0.18/5.71 % Success case prop preproc time : 0.000
% 0.18/5.71 % Success case prop encoding time : 0.000
% 0.18/5.71 % Success case prop solver time : 0.000
% 0.18/5.71 % Current number of processed clauses : 54
% 0.18/5.71 % Positive orientable unit clauses : 38
% 0.18/5.71 % Positive unorientable unit clauses: 0
% 0.18/5.71 % Negative unit clauses : 2
% 0.18/5.71 % Non-unit-clauses : 14
% 0.18/5.71 % Current number of unprocessed clauses: 171
% 0.18/5.71 % ...number of literals in the above : 606
% 0.18/5.71 % Current number of archived formulas : 0
% 0.18/5.71 % Current number of archived clauses : 0
% 0.18/5.71 % Clause-clause subsumption calls (NU) : 43
% 0.18/5.71 % Rec. Clause-clause subsumption calls : 9
% 0.18/5.71 % Non-unit clause-clause subsumptions : 0
% 0.18/5.71 % Unit Clause-clause subsumption calls : 0
% 0.18/5.71 % Rewrite failures with RHS unbound : 0
% 0.18/5.71 % BW rewrite match attempts : 0
% 0.18/5.71 % BW rewrite match successes : 0
% 0.18/5.71 % Condensation attempts : 0
% 0.18/5.71 % Condensation successes : 0
% 0.18/5.71 % Termbank termtop insertions : 7687
% 0.18/5.71 % Search garbage collected termcells : 560
% 0.18/5.71
% 0.18/5.71 % -------------------------------------------------
% 0.18/5.71 % User time : 0.011 s
% 0.18/5.71 % System time : 0.005 s
% 0.18/5.71 % Total time : 0.016 s
% 0.18/5.71 % Maximum resident set size: 4072 pages
% 0.18/5.71
% 0.18/5.71 % -------------------------------------------------
% 0.18/5.71 % User time : 0.050 s
% 0.18/5.71 % System time : 0.020 s
% 0.18/5.71 % Total time : 0.070 s
% 0.18/5.71 % Maximum resident set size: 5120 pages
% 0.18/5.71 % E exiting
%------------------------------------------------------------------------------