%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC392-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 : n026.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:44:13 PM UTC 2026
% Result : Unsatisfiable 0.90s 0.61s
% Output : CNFRefutation 0.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of clauses : 48 ( 25 unt; 17 nHn; 48 RR)
% Number of literals : 93 ( 33 equ; 39 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause161,axiom,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause161) ).
cnf(clause71,axiom,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(clause116,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(co1_9,negated_conjecture,
~ memberP(sk2,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_15,negated_conjecture,
( nil = sk3
| cons(sk6,nil) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_11,negated_conjecture,
( nil = sk3
| ssItem(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_8,negated_conjecture,
memberP(sk1,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_12,negated_conjecture,
( nil = sk4
| cons(sk6,nil) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_10,negated_conjecture,
( nil = sk4
| ssItem(sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_16,negated_conjecture,
( nil = sk3
| memberP(sk4,sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(clause11,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause11) ).
cnf(c_0_16,plain,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
inference(fof_simplification,[status(thm)],[clause161]) ).
cnf(c_0_17,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_18,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_19,negated_conjecture,
~ memberP(sk2,sk5),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_20,plain,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
c_0_16 ).
cnf(c_0_21,negated_conjecture,
( nil = sk3
| cons(sk6,nil) = sk3 ),
co1_15 ).
cnf(c_0_22,axiom,
ssList(nil),
clause8 ).
cnf(c_0_23,negated_conjecture,
( nil = sk3
| ssItem(sk6) ),
co1_11 ).
cnf(c_0_24,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
c_0_17 ).
cnf(c_0_25,negated_conjecture,
memberP(sk1,sk5),
co1_8 ).
cnf(c_0_26,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_27,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
c_0_18 ).
cnf(c_0_28,negated_conjecture,
( nil = sk4
| cons(sk6,nil) = sk3 ),
co1_12 ).
cnf(c_0_29,negated_conjecture,
( nil = sk4
| ssItem(sk6) ),
co1_10 ).
cnf(c_0_30,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_31,negated_conjecture,
~ memberP(sk2,sk5),
c_0_19 ).
cnf(c_0_32,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_33,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk3,X1)
| sk6 = X1
| sk3 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),c_0_23]),c_0_24]) ).
cnf(c_0_34,negated_conjecture,
memberP(sk3,sk5),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_35,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_36,negated_conjecture,
( ~ ssList(X1)
| sk3 != X1
| singletonP(X1)
| sk4 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_37,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_30,c_0_26]) ).
cnf(c_0_38,negated_conjecture,
~ memberP(sk4,sk5),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( sk3 = nil
| sk5 = sk6 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]) ).
cnf(c_0_40,negated_conjecture,
( nil = sk3
| memberP(sk4,sk6) ),
co1_16 ).
cnf(c_0_41,plain,
~ singletonP(nil),
inference(fof_simplification,[status(thm)],[clause11]) ).
cnf(c_0_42,negated_conjecture,
( singletonP(sk3)
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
sk3 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]) ).
cnf(c_0_44,plain,
~ singletonP(nil),
c_0_41 ).
cnf(c_0_45,negated_conjecture,
sk4 = nil,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_46,negated_conjecture,
~ memberP(nil,sk5),
inference(rw,[status(thm)],[c_0_38,c_0_45]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_43]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC392-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.13/0.38 % Computer : n026.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.38 % CPULimit : 300
% 0.13/0.38 % WCLimit : 300
% 0.13/0.38 % DateTime : Mon Sep 21 08:23:38 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.43 Running first-order theorem proving
% 0.18/0.43 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.90/0.61 % Version: 3.5.1
% 0.90/0.61 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.90/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.90/0.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.90/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.90/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.90/0.61 % Starting sh5l with 300s (1) cores
% 0.90/0.61 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1827595 completed with status 0
% 0.90/0.61 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.90/0.61 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.90/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.90/0.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.90/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.90/0.61 % No SInE strategy applied
% 0.90/0.61 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.90/0.61 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.90/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.90/0.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.90/0.61 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.90/0.61 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.90/0.61 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.90/0.61 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 1827604 completed with status 0
% 0.90/0.61 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.90/0.61 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.90/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.90/0.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.90/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.90/0.61 % No SInE strategy applied
% 0.90/0.61 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.90/0.61 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.90/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.90/0.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.90/0.61 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.90/0.61 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.90/0.61 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.90/0.61 % Preprocessing time : 0.007 s
% 0.90/0.61
% 0.90/0.61 % Proof found!
% 0.90/0.61 % SZS status Unsatisfiable
% 0.90/0.61 % SZS output start CNFRefutation
% See solution above
% 0.90/0.61 % Parsed axioms : 202
% 0.90/0.61 % Removed by relevancy pruning/SinE : 0
% 0.90/0.61 % Initial clauses : 202
% 0.90/0.61 % Removed in clause preprocessing : 0
% 0.90/0.61 % Initial clauses in saturation : 202
% 0.90/0.61 % Processed clauses : 464
% 0.90/0.61 % ...of these trivial : 4
% 0.90/0.61 % ...subsumed : 97
% 0.90/0.61 % ...remaining for further processing : 362
% 0.90/0.61 % Other redundant clauses eliminated : 32
% 0.90/0.61 % Clauses deleted for lack of memory : 0
% 0.90/0.61 % Backward-subsumed : 6
% 0.90/0.61 % Backward-rewritten : 104
% 0.90/0.61 % Generated clauses : 2153
% 0.90/0.61 % ...of the previous two non-redundant : 2032
% 0.90/0.61 % ...aggressively subsumed : 0
% 0.90/0.61 % Contextual simplify-reflections : 56
% 0.90/0.61 % Paramodulations : 2049
% 0.90/0.61 % Factorizations : 39
% 0.90/0.61 % NegExts : 0
% 0.90/0.61 % Equation resolutions : 65
% 0.90/0.61 % Disequality decompositions : 0
% 0.90/0.61 % Total rewrite steps : 955
% 0.90/0.61 % ...of those cached : 863
% 0.90/0.61 % Propositional unsat checks : 0
% 0.90/0.61 % Propositional check models : 0
% 0.90/0.61 % Propositional check unsatisfiable : 0
% 0.90/0.61 % Propositional clauses : 0
% 0.90/0.61 % Propositional clauses after purity: 0
% 0.90/0.61 % Propositional unsat core size : 0
% 0.90/0.61 % Propositional preprocessing time : 0.000
% 0.90/0.61 % Propositional encoding time : 0.000
% 0.90/0.61 % Propositional solver time : 0.000
% 0.90/0.61 % Success case prop preproc time : 0.000
% 0.90/0.61 % Success case prop encoding time : 0.000
% 0.90/0.61 % Success case prop solver time : 0.000
% 0.90/0.61 % Current number of processed clauses : 247
% 0.90/0.61 % Positive orientable unit clauses : 57
% 0.90/0.61 % Positive unorientable unit clauses: 0
% 0.90/0.61 % Negative unit clauses : 3
% 0.90/0.61 % Non-unit-clauses : 187
% 0.90/0.61 % Current number of unprocessed clauses: 1718
% 0.90/0.61 % ...number of literals in the above : 7912
% 0.90/0.61 % Current number of archived formulas : 0
% 0.90/0.61 % Current number of archived clauses : 110
% 0.90/0.61 % Clause-clause subsumption calls (NU) : 11799
% 0.90/0.61 % Rec. Clause-clause subsumption calls : 1742
% 0.90/0.61 % Non-unit clause-clause subsumptions : 155
% 0.90/0.61 % Unit Clause-clause subsumption calls : 272
% 0.90/0.61 % Rewrite failures with RHS unbound : 0
% 0.90/0.61 % BW rewrite match attempts : 3
% 0.90/0.61 % BW rewrite match successes : 3
% 0.90/0.61 % Condensation attempts : 0
% 0.90/0.61 % Condensation successes : 0
% 0.90/0.61 % Termbank termtop insertions : 44095
% 0.90/0.61 % Search garbage collected termcells : 539
% 0.90/0.61
% 0.90/0.61 % -------------------------------------------------
% 0.90/0.61 % User time : 0.126 s
% 0.90/0.61 % System time : 0.010 s
% 0.90/0.61 % Total time : 0.136 s
% 0.90/0.61 % Maximum resident set size: 4068 pages
% 0.90/0.61
% 0.90/0.61 % -------------------------------------------------
% 0.90/0.61 % User time : 0.416 s
% 0.90/0.61 % System time : 0.035 s
% 0.90/0.61 % Total time : 0.451 s
% 0.90/0.61 % Maximum resident set size: 5120 pages
% 0.90/0.61 % E exiting
%------------------------------------------------------------------------------