%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET012-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:13:02 PM UTC 2026
% Result : Unsatisfiable 4.95s 1.44s
% Output : CNFRefutation 4.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 33 ( 11 unt; 10 nHn; 24 RR)
% Number of literals : 66 ( 16 equ; 27 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 40 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',complement1) ).
cnf(complement2,axiom,
( ~ little_set(X1)
| member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',complement2) ).
cnf(a2,axiom,
( ~ member(X1,X2)
| little_set(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',a2) ).
cnf(complement_of_a_is_b,hypothesis,
complement(as) = bs,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement_of_a_is_b) ).
cnf(complement_of_b_is_c,hypothesis,
complement(bs) = cs,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement_of_b_is_c) ).
cnf(extensionality2,axiom,
( X1 = X2
| member(f1(X1,X2),X2)
| member(f1(X1,X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',extensionality2) ).
cnf(prove_a_equals_c,negated_conjecture,
as != cs,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_equals_c) ).
cnf(extensionality3,axiom,
( ~ member(f1(X1,X2),X2)
| ~ member(f1(X1,X2),X1)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',extensionality3) ).
cnf(extensionality1,axiom,
( X1 = X2
| little_set(f1(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET003-0.ax',extensionality1) ).
cnf(c_0_9,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_10,plain,
( ~ little_set(X1)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_11,plain,
( ~ member(X1,X2)
| little_set(X1) ),
inference(fof_simplification,[status(thm)],[a2]) ).
cnf(c_0_12,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_9 ).
cnf(c_0_13,plain,
( ~ little_set(X1)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_10 ).
cnf(c_0_14,plain,
( ~ member(X1,X2)
| little_set(X1) ),
c_0_11 ).
cnf(c_0_15,plain,
( ~ member(X1,complement(complement(X2)))
| member(X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_16,hypothesis,
complement(as) = bs,
complement_of_a_is_b ).
cnf(c_0_17,hypothesis,
complement(bs) = cs,
complement_of_b_is_c ).
cnf(c_0_18,hypothesis,
( ~ member(X1,cs)
| member(X1,as) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_19,axiom,
( X1 = X2
| member(f1(X1,X2),X2)
| member(f1(X1,X2),X1) ),
extensionality2 ).
cnf(c_0_20,negated_conjecture,
as != cs,
inference(fof_simplification,[status(thm)],[prove_a_equals_c]) ).
cnf(c_0_21,plain,
( ~ member(f1(X1,X2),X2)
| ~ member(f1(X1,X2),X1)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[extensionality3]) ).
cnf(c_0_22,hypothesis,
( member(f1(cs,X1),X1)
| member(f1(cs,X1),as)
| cs = X1 ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
as != cs,
c_0_20 ).
cnf(c_0_24,hypothesis,
( ~ member(X1,complement(cs))
| member(X1,bs) ),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_25,plain,
( ~ member(f1(X1,X2),X2)
| ~ member(f1(X1,X2),X1)
| X1 = X2 ),
c_0_21 ).
cnf(c_0_26,hypothesis,
member(f1(cs,as),as),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_22]),c_0_23]) ).
cnf(c_0_27,hypothesis,
( ~ little_set(X1)
| member(X1,bs)
| member(X1,cs) ),
inference(spm,[status(thm)],[c_0_24,c_0_13]) ).
cnf(c_0_28,axiom,
( X1 = X2
| little_set(f1(X1,X2)) ),
extensionality1 ).
cnf(c_0_29,hypothesis,
~ member(f1(cs,as),cs),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_23]) ).
cnf(c_0_30,hypothesis,
( member(f1(X1,X2),cs)
| member(f1(X1,X2),bs)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,hypothesis,
~ member(f1(cs,as),bs),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_26]),c_0_16]) ).
cnf(c_0_32,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_23]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET012-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.54 % Computer : n014.cluster.edu
% 0.09/0.54 % Model : x86_64 x86_64
% 0.09/0.54 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.54 % Memory : 8046.5625MB
% 0.09/0.54 % OS : Linux 6.8.0-71-generic
% 0.09/0.54 % CPULimit : 300
% 0.09/0.54 % WCLimit : 300
% 0.09/0.54 % DateTime : Mon Sep 21 04:41:36 UTC 2026
% 0.09/0.54 % CPUTime :
% 0.09/0.54 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.58 Running first-order theorem proving
% 0.13/0.58 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
% 4.95/1.44 % Version: 3.5.1
% 4.95/1.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.95/1.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.95/1.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.95/1.44 % Starting new_bool_3 with 300s (1) cores
% 4.95/1.44 % Starting new_bool_1 with 300s (1) cores
% 4.95/1.44 % Starting sh5l with 300s (1) cores
% 4.95/1.44 % new_bool_3 with pid 3155628 completed with status 9
% 4.95/1.44 % new_bool_1 with pid 3155629 completed with status 9
% 4.95/1.44 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3155627 completed with status 0
% 4.95/1.44 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 4.95/1.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.95/1.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.95/1.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.95/1.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.95/1.44 % No SInE strategy applied
% 4.95/1.44 % Search class: FGHSF-FFLS31-MFFFFFNN
% 4.95/1.44 % partial match(1): FGHSM-FFLS31-MFFFFFNN
% 4.95/1.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.95/1.44 % Starting SubtermCWHack with 136s (1) cores
% 4.95/1.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.95/1.44 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 224s (1) cores
% 4.95/1.44 % Starting new_bool_3 with 216s (1) cores
% 4.95/1.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2i with 136s (1) cores
% 4.95/1.44 % new_bool_3 with pid 3155639 completed with status 0
% 4.95/1.44 % Result found by new_bool_3
% 4.95/1.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 4.95/1.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.95/1.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 4.95/1.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.95/1.44 % No SInE strategy applied
% 4.95/1.44 % Search class: FGHSF-FFLS31-MFFFFFNN
% 4.95/1.44 % partial match(1): FGHSM-FFLS31-MFFFFFNN
% 4.95/1.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.95/1.44 % Starting SubtermCWHack with 136s (1) cores
% 4.95/1.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 4.95/1.44 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 224s (1) cores
% 4.95/1.44 % Starting new_bool_3 with 216s (1) cores
% 4.95/1.44 % Preprocessing time : 0.003 s
% 4.95/1.44 % Presaturation interreduction done
% 4.95/1.44
% 4.95/1.44 % Proof found!
% 4.95/1.44 % SZS status Unsatisfiable
% 4.95/1.44 % SZS output start CNFRefutation
% See solution above
% 4.95/1.44 % Parsed axioms : 144
% 4.95/1.44 % Removed by relevancy pruning/SinE : 0
% 4.95/1.44 % Initial clauses : 144
% 4.95/1.44 % Removed in clause preprocessing : 6
% 4.95/1.44 % Initial clauses in saturation : 138
% 4.95/1.44 % Processed clauses : 5972
% 4.95/1.44 % ...of these trivial : 55
% 4.95/1.44 % ...subsumed : 3418
% 4.95/1.44 % ...remaining for further processing : 2499
% 4.95/1.44 % Other redundant clauses eliminated : 26
% 4.95/1.44 % Clauses deleted for lack of memory : 0
% 4.95/1.44 % Backward-subsumed : 188
% 4.95/1.44 % Backward-rewritten : 109
% 4.95/1.44 % Generated clauses : 31962
% 4.95/1.44 % ...of the previous two non-redundant : 29751
% 4.95/1.44 % ...aggressively subsumed : 0
% 4.95/1.44 % Contextual simplify-reflections : 67
% 4.95/1.44 % Paramodulations : 31920
% 4.95/1.44 % Factorizations : 16
% 4.95/1.44 % NegExts : 0
% 4.95/1.44 % Equation resolutions : 26
% 4.95/1.44 % Disequality decompositions : 0
% 4.95/1.44 % Total rewrite steps : 5552
% 4.95/1.44 % ...of those cached : 5210
% 4.95/1.44 % Propositional unsat checks : 0
% 4.95/1.44 % Propositional check models : 0
% 4.95/1.44 % Propositional check unsatisfiable : 0
% 4.95/1.44 % Propositional clauses : 0
% 4.95/1.44 % Propositional clauses after purity: 0
% 4.95/1.44 % Propositional unsat core size : 0
% 4.95/1.44 % Propositional preprocessing time : 0.000
% 4.95/1.44 % Propositional encoding time : 0.000
% 4.95/1.44 % Propositional solver time : 0.000
% 4.95/1.44 % Success case prop preproc time : 0.000
% 4.95/1.44 % Success case prop encoding time : 0.000
% 4.95/1.44 % Success case prop solver time : 0.000
% 4.95/1.44 % Current number of processed clauses : 2050
% 4.95/1.44 % Positive orientable unit clauses : 158
% 4.95/1.44 % Positive unorientable unit clauses: 0
% 4.95/1.44 % Negative unit clauses : 240
% 4.95/1.44 % Non-unit-clauses : 1652
% 4.95/1.44 % Current number of unprocessed clauses: 23729
% 4.95/1.44 % ...number of literals in the above : 64408
% 4.95/1.44 % Current number of archived formulas : 0
% 4.95/1.44 % Current number of archived clauses : 441
% 4.95/1.44 % Clause-clause subsumption calls (NU) : 352965
% 4.95/1.44 % Rec. Clause-clause subsumption calls : 245024
% 4.95/1.44 % Non-unit clause-clause subsumptions : 1419
% 4.95/1.44 % Unit Clause-clause subsumption calls : 86393
% 4.95/1.44 % Rewrite failures with RHS unbound : 0
% 4.95/1.44 % BW rewrite match attempts : 46
% 4.95/1.44 % BW rewrite match successes : 12
% 4.95/1.44 % Condensation attempts : 0
% 4.95/1.44 % Condensation successes : 0
% 4.95/1.44 % Termbank termtop insertions : 442899
% 4.95/1.44 % Search garbage collected termcells : 316
% 4.95/1.44
% 4.95/1.44 % -------------------------------------------------
% 4.95/1.44 % User time : 0.787 s
% 4.95/1.44 % System time : 0.034 s
% 4.95/1.44 % Total time : 0.821 s
% 4.95/1.44 % Maximum resident set size: 3768 pages
% 4.95/1.44
% 4.95/1.44 % -------------------------------------------------
% 4.95/1.44 % User time : 3.959 s
% 4.95/1.44 % System time : 0.247 s
% 4.95/1.44 % Total time : 4.206 s
% 4.95/1.44 % Maximum resident set size: 4864 pages
% 4.95/1.44 % E exiting
%------------------------------------------------------------------------------