%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC364-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 : n007.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:46:02 PM UTC 2026
% Result : Unsatisfiable 0.30s 0.71s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of clauses : 51 ( 18 unt; 1 nHn; 51 RR)
% Number of literals : 116 ( 22 equ; 69 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 49 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_13,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk3) = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_7,negated_conjecture,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_12,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
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(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(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause173,axiom,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_14,negated_conjecture,
( ~ neq(sk4,nil)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(c_0_15,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk3) = sk4 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_16,negated_conjecture,
neq(sk2,nil),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_17,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_18,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk5,nil),sk3) = sk4 ),
c_0_15 ).
cnf(c_0_19,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_20,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_21,negated_conjecture,
neq(sk2,nil),
c_0_16 ).
cnf(c_0_22,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_23,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
c_0_17 ).
cnf(c_0_24,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_25,negated_conjecture,
app(cons(sk5,nil),sk1) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_20]),c_0_21])]) ).
cnf(c_0_26,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_22 ).
cnf(c_0_27,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_20]),c_0_21])]) ).
cnf(c_0_28,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_29,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_30,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_24 ).
cnf(c_0_31,negated_conjecture,
cons(sk5,sk1) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_32,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
inference(fof_simplification,[status(thm)],[clause173]) ).
cnf(c_0_33,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_29 ).
cnf(c_0_34,negated_conjecture,
( ~ ssList(X1)
| cons(sk5,app(sk1,X1)) = app(sk2,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_27]),c_0_28])]) ).
cnf(c_0_35,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_36,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
c_0_32 ).
cnf(c_0_37,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(app(sk1,X1))
| ssList(app(sk2,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_27])]) ).
cnf(c_0_38,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_35 ).
cnf(c_0_39,negated_conjecture,
( ~ neq(sk4,nil)
| ~ segmentP(sk2,sk1) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(app(app(X1,X2),X3))
| segmentP(app(app(X1,X2),X3),X2) ),
inference(er,[status(thm)],[c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( ~ ssList(X1)
| ssList(app(sk2,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_28])]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_43,negated_conjecture,
( ~ neq(sk4,nil)
| ~ segmentP(sk2,sk1) ),
c_0_39 ).
cnf(c_0_44,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(cons(sk5,nil))
| segmentP(app(sk2,X1),sk1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_25]),c_0_28])]),c_0_41]) ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_42 ).
cnf(c_0_46,axiom,
ssList(nil),
clause8 ).
cnf(c_0_47,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_48,negated_conjecture,
~ segmentP(sk2,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_20]),c_0_21])]) ).
cnf(c_0_49,negated_conjecture,
~ ssList(cons(sk5,nil)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_47])]),c_0_48]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_33]),c_0_27]),c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC364-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n007.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.46 % WCLimit : 300
% 0.18/0.46 % DateTime : Mon Sep 21 08:16:50 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.53 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.30/0.71 % Version: 3.5.1
% 0.30/0.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.30/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.30/0.71 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.71 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.71 % Starting sh5l with 300s (1) cores
% 0.30/0.71 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 626139 completed with status 0
% 0.30/0.71 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.30/0.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.30/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.30/0.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.71 % No SInE strategy applied
% 0.30/0.71 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.30/0.71 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/0.71 % Starting SubtermCWHack with 136s (1) cores
% 0.30/0.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.30/0.71 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.30/0.71 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.30/0.71 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.30/0.71 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 626146 completed with status 0
% 0.30/0.71 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.30/0.71 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.30/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.30/0.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.71 % No SInE strategy applied
% 0.30/0.71 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.30/0.71 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/0.71 % Starting SubtermCWHack with 136s (1) cores
% 0.30/0.71 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.30/0.71 % Preprocessing time : 0.006 s
% 0.30/0.71 % Presaturation interreduction done
% 0.30/0.71
% 0.30/0.71 % Proof found!
% 0.30/0.71 % SZS status Unsatisfiable
% 0.30/0.71 % SZS output start CNFRefutation
% See solution above
% 0.30/0.71 % Parsed axioms : 199
% 0.30/0.71 % Removed by relevancy pruning/SinE : 0
% 0.30/0.71 % Initial clauses : 199
% 0.30/0.71 % Removed in clause preprocessing : 0
% 0.30/0.71 % Initial clauses in saturation : 199
% 0.30/0.71 % Processed clauses : 884
% 0.30/0.71 % ...of these trivial : 13
% 0.30/0.71 % ...subsumed : 199
% 0.30/0.71 % ...remaining for further processing : 672
% 0.30/0.71 % Other redundant clauses eliminated : 90
% 0.30/0.71 % Clauses deleted for lack of memory : 0
% 0.30/0.71 % Backward-subsumed : 58
% 0.30/0.71 % Backward-rewritten : 7
% 0.30/0.71 % Generated clauses : 3920
% 0.30/0.71 % ...of the previous two non-redundant : 3561
% 0.30/0.71 % ...aggressively subsumed : 0
% 0.30/0.71 % Contextual simplify-reflections : 20
% 0.30/0.71 % Paramodulations : 3826
% 0.30/0.71 % Factorizations : 0
% 0.30/0.71 % NegExts : 0
% 0.30/0.71 % Equation resolutions : 95
% 0.30/0.71 % Disequality decompositions : 0
% 0.30/0.71 % Total rewrite steps : 1968
% 0.30/0.71 % ...of those cached : 1835
% 0.30/0.71 % Propositional unsat checks : 0
% 0.30/0.71 % Propositional check models : 0
% 0.30/0.71 % Propositional check unsatisfiable : 0
% 0.30/0.71 % Propositional clauses : 0
% 0.30/0.71 % Propositional clauses after purity: 0
% 0.30/0.71 % Propositional unsat core size : 0
% 0.30/0.71 % Propositional preprocessing time : 0.000
% 0.30/0.71 % Propositional encoding time : 0.000
% 0.30/0.71 % Propositional solver time : 0.000
% 0.30/0.71 % Success case prop preproc time : 0.000
% 0.30/0.71 % Success case prop encoding time : 0.000
% 0.30/0.71 % Success case prop solver time : 0.000
% 0.30/0.71 % Current number of processed clauses : 397
% 0.30/0.71 % Positive orientable unit clauses : 87
% 0.30/0.71 % Positive unorientable unit clauses: 0
% 0.30/0.71 % Negative unit clauses : 10
% 0.30/0.71 % Non-unit-clauses : 300
% 0.30/0.71 % Current number of unprocessed clauses: 3041
% 0.30/0.71 % ...number of literals in the above : 11851
% 0.30/0.71 % Current number of archived formulas : 0
% 0.30/0.71 % Current number of archived clauses : 252
% 0.30/0.71 % Clause-clause subsumption calls (NU) : 24734
% 0.30/0.71 % Rec. Clause-clause subsumption calls : 7238
% 0.30/0.71 % Non-unit clause-clause subsumptions : 192
% 0.30/0.71 % Unit Clause-clause subsumption calls : 331
% 0.30/0.71 % Rewrite failures with RHS unbound : 0
% 0.30/0.71 % BW rewrite match attempts : 7
% 0.30/0.71 % BW rewrite match successes : 7
% 0.30/0.71 % Condensation attempts : 0
% 0.30/0.71 % Condensation successes : 0
% 0.30/0.71 % Termbank termtop insertions : 64340
% 0.30/0.71 % Search garbage collected termcells : 536
% 0.30/0.71
% 0.30/0.71 % -------------------------------------------------
% 0.30/0.71 % User time : 0.089 s
% 0.30/0.71 % System time : 0.013 s
% 0.30/0.71 % Total time : 0.102 s
% 0.30/0.71 % Maximum resident set size: 3812 pages
% 0.30/0.71
% 0.30/0.71 % -------------------------------------------------
% 0.30/0.71 % User time : 0.490 s
% 0.30/0.71 % System time : 0.047 s
% 0.30/0.71 % Total time : 0.537 s
% 0.30/0.71 % Maximum resident set size: 4864 pages
% 0.30/0.71 % E exiting
%------------------------------------------------------------------------------