%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET012-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n002.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 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 31 ( 10 unt; 13 nHn; 22 RR)
% Number of literals : 66 ( 18 equ; 26 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 2 ( 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 : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(complement2,axiom,
( ~ little_set(X1)
| member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement2) ).
cnf(complement_of_b_is_c,hypothesis,
complement(bs) = cs,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement_of_b_is_c) ).
cnf(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement1) ).
cnf(extensionality3,axiom,
( ~ member(f1(X1,X2),X2)
| ~ member(f1(X1,X2),X1)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',extensionality3) ).
cnf(extensionality1,axiom,
( X1 = X2
| little_set(f1(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',extensionality1) ).
cnf(complement_of_a_is_b,hypothesis,
complement(as) = bs,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement_of_a_is_b) ).
cnf(prove_a_equals_c,negated_conjecture,
as != cs,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_equals_c) ).
cnf(extensionality2,axiom,
( X1 = X2
| member(f1(X1,X2),X2)
| member(f1(X1,X2),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',extensionality2) ).
cnf(c_0_8,plain,
( ~ little_set(X1)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_9,plain,
( ~ little_set(X1)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_8 ).
cnf(c_0_10,hypothesis,
complement(bs) = cs,
complement_of_b_is_c ).
cnf(c_0_11,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_12,plain,
( ~ member(f1(X1,X2),X2)
| ~ member(f1(X1,X2),X1)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[extensionality3]) ).
cnf(c_0_13,hypothesis,
( ~ little_set(X1)
| member(X1,cs)
| member(X1,bs) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,axiom,
( X1 = X2
| little_set(f1(X1,X2)) ),
extensionality1 ).
cnf(c_0_15,hypothesis,
complement(as) = bs,
complement_of_a_is_b ).
cnf(c_0_16,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_11 ).
cnf(c_0_17,plain,
( ~ member(f1(X1,X2),X2)
| ~ member(f1(X1,X2),X1)
| X1 = X2 ),
c_0_12 ).
cnf(c_0_18,hypothesis,
( member(f1(X1,X2),bs)
| member(f1(X1,X2),cs)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,hypothesis,
( ~ little_set(X1)
| member(X1,bs)
| member(X1,as) ),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
as != cs,
inference(fof_simplification,[status(thm)],[prove_a_equals_c]) ).
cnf(c_0_21,hypothesis,
( ~ member(X1,bs)
| ~ member(X1,cs) ),
inference(spm,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_22,axiom,
( X1 = X2
| member(f1(X1,X2),X2)
| member(f1(X1,X2),X1) ),
extensionality2 ).
cnf(c_0_23,hypothesis,
( ~ member(f1(X1,cs),X1)
| member(f1(X1,cs),bs)
| X1 = cs ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,hypothesis,
( member(f1(X1,X2),as)
| member(f1(X1,X2),bs)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_25,negated_conjecture,
as != cs,
c_0_20 ).
cnf(c_0_26,hypothesis,
( ~ member(f1(X1,cs),bs)
| member(f1(X1,cs),X1)
| X1 = cs ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,hypothesis,
member(f1(as,cs),bs),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_28,hypothesis,
( ~ member(X1,as)
| ~ member(X1,bs) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_29,hypothesis,
member(f1(as,cs),as),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_25]) ).
cnf(c_0_30,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET012-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n002.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 04:44:18 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.13/0.42 % Version: 3.5.1
% 0.13/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 % Starting sh5l with 300s (1) cores
% 0.13/0.42 % new_bool_3 with pid 2450259 completed with status 0
% 0.13/0.42 % Result found by new_bool_3
% 0.13/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.13/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.42 % SubtermCWHack with pid 2450267 completed with status 0
% 0.13/0.42 % Result found by SubtermCWHack
% 0.13/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.13/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.42 % Preprocessing time : 0.001 s
% 0.13/0.42
% 0.13/0.42 % Proof found!
% 0.13/0.42 % SZS status Unsatisfiable
% 0.13/0.42 % SZS output start CNFRefutation
% See solution above
% 0.13/0.42 % Parsed axioms : 11
% 0.13/0.42 % Removed by relevancy pruning/SinE : 2
% 0.13/0.42 % Initial clauses : 9
% 0.13/0.42 % Removed in clause preprocessing : 0
% 0.13/0.42 % Initial clauses in saturation : 9
% 0.13/0.42 % Processed clauses : 28
% 0.13/0.42 % ...of these trivial : 0
% 0.13/0.42 % ...subsumed : 4
% 0.13/0.42 % ...remaining for further processing : 24
% 0.13/0.42 % Other redundant clauses eliminated : 0
% 0.13/0.42 % Clauses deleted for lack of memory : 0
% 0.13/0.42 % Backward-subsumed : 0
% 0.13/0.42 % Backward-rewritten : 0
% 0.13/0.42 % Generated clauses : 42
% 0.13/0.42 % ...of the previous two non-redundant : 30
% 0.13/0.42 % ...aggressively subsumed : 0
% 0.13/0.42 % Contextual simplify-reflections : 0
% 0.13/0.42 % Paramodulations : 40
% 0.13/0.42 % Factorizations : 2
% 0.13/0.42 % NegExts : 0
% 0.13/0.42 % Equation resolutions : 0
% 0.13/0.42 % Disequality decompositions : 0
% 0.13/0.42 % Total rewrite steps : 7
% 0.13/0.42 % ...of those cached : 4
% 0.13/0.42 % Propositional unsat checks : 0
% 0.13/0.42 % Propositional check models : 0
% 0.13/0.42 % Propositional check unsatisfiable : 0
% 0.13/0.42 % Propositional clauses : 0
% 0.13/0.42 % Propositional clauses after purity: 0
% 0.13/0.42 % Propositional unsat core size : 0
% 0.13/0.42 % Propositional preprocessing time : 0.000
% 0.13/0.42 % Propositional encoding time : 0.000
% 0.13/0.42 % Propositional solver time : 0.000
% 0.13/0.42 % Success case prop preproc time : 0.000
% 0.13/0.42 % Success case prop encoding time : 0.000
% 0.13/0.42 % Success case prop solver time : 0.000
% 0.13/0.42 % Current number of processed clauses : 24
% 0.13/0.42 % Positive orientable unit clauses : 5
% 0.13/0.42 % Positive unorientable unit clauses: 0
% 0.13/0.42 % Negative unit clauses : 1
% 0.13/0.42 % Non-unit-clauses : 18
% 0.13/0.42 % Current number of unprocessed clauses: 11
% 0.13/0.42 % ...number of literals in the above : 34
% 0.13/0.42 % Current number of archived formulas : 0
% 0.13/0.42 % Current number of archived clauses : 0
% 0.13/0.42 % Clause-clause subsumption calls (NU) : 33
% 0.13/0.42 % Rec. Clause-clause subsumption calls : 22
% 0.13/0.42 % Non-unit clause-clause subsumptions : 4
% 0.13/0.42 % Unit Clause-clause subsumption calls : 0
% 0.13/0.42 % Rewrite failures with RHS unbound : 0
% 0.13/0.42 % BW rewrite match attempts : 0
% 0.13/0.42 % BW rewrite match successes : 0
% 0.13/0.42 % Condensation attempts : 0
% 0.13/0.42 % Condensation successes : 0
% 0.13/0.42 % Termbank termtop insertions : 770
% 0.13/0.42 % Search garbage collected termcells : 19
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.004 s
% 0.13/0.42 % System time : 0.002 s
% 0.13/0.42 % Total time : 0.006 s
% 0.13/0.42 % Maximum resident set size: 3888 pages
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.005 s
% 0.13/0.42 % System time : 0.007 s
% 0.13/0.42 % Total time : 0.012 s
% 0.13/0.42 % Maximum resident set size: 4864 pages
% 0.13/0.42 % E exiting
%------------------------------------------------------------------------------