%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET150-6 : TPTP v9.3.1. Bugfixed v2.1.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:16:42 PM UTC 2026
% Result : Unsatisfiable 1.06s 0.67s
% Output : CNFRefutation 1.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 33 ( 9 unt; 8 nHn; 20 RR)
% Number of literals : 66 ( 8 equ; 31 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 55 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).
cnf(complement1,axiom,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).
cnf(class_elements_are_sets,axiom,
subclass(X1,universal_class),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).
cnf(not_subclass_members1,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members1) ).
cnf(complement2,axiom,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).
cnf(not_subclass_members2,axiom,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',not_subclass_members2) ).
cnf(subclass_implies_equal,axiom,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_implies_equal) ).
cnf(prove_complement_is_self_cancelling_1,negated_conjecture,
complement(complement(x)) != x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_complement_is_self_cancelling_1) ).
cnf(c_0_8,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
inference(fof_simplification,[status(thm)],[subclass_members]) ).
cnf(c_0_9,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement1]) ).
cnf(c_0_10,plain,
( ~ member(X3,X1)
| ~ subclass(X1,X2)
| member(X3,X2) ),
c_0_8 ).
cnf(c_0_11,axiom,
subclass(X1,universal_class),
class_elements_are_sets ).
cnf(c_0_12,plain,
( ~ member(X1,X2)
| ~ member(X1,complement(X2)) ),
c_0_9 ).
cnf(c_0_13,axiom,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),X1) ),
not_subclass_members1 ).
cnf(c_0_14,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
inference(fof_simplification,[status(thm)],[complement2]) ).
cnf(c_0_15,plain,
( ~ member(X1,X2)
| member(X1,universal_class) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_subclass_members2]) ).
cnf(c_0_17,plain,
( ~ member(not_subclass_element(complement(X1),X2),X1)
| subclass(complement(X1),X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( ~ member(X1,universal_class)
| member(X1,X2)
| member(X1,complement(X2)) ),
c_0_14 ).
cnf(c_0_19,plain,
( subclass(X1,X2)
| member(not_subclass_element(X1,X2),universal_class) ),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_20,plain,
( ~ member(not_subclass_element(X1,X2),X2)
| subclass(X1,X2) ),
c_0_16 ).
cnf(c_0_21,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[subclass_implies_equal]) ).
cnf(c_0_22,plain,
( subclass(complement(complement(X1)),X2)
| member(not_subclass_element(complement(complement(X1)),X2),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_23,plain,
( subclass(X1,complement(X2))
| member(not_subclass_element(X1,complement(X2)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_18]),c_0_19]) ).
cnf(c_0_24,plain,
( ~ subclass(X2,X1)
| ~ subclass(X1,X2)
| X1 = X2 ),
c_0_21 ).
cnf(c_0_25,plain,
subclass(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_20,c_0_22]) ).
cnf(c_0_26,plain,
( ~ member(not_subclass_element(X1,complement(complement(X2))),X2)
| subclass(X1,complement(complement(X2))) ),
inference(spm,[status(thm)],[c_0_12,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
complement(complement(x)) != x,
inference(fof_simplification,[status(thm)],[prove_complement_is_self_cancelling_1]) ).
cnf(c_0_28,plain,
( ~ subclass(X1,complement(complement(X1)))
| complement(complement(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
subclass(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_26,c_0_13]) ).
cnf(c_0_30,negated_conjecture,
complement(complement(x)) != x,
c_0_27 ).
cnf(c_0_31,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET150-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 % Computer : n014.cluster.edu
% 0.12/0.39 % Model : x86_64 x86_64
% 0.12/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.39 % Memory : 8046.5625MB
% 0.12/0.39 % OS : Linux 6.8.0-71-generic
% 0.12/0.39 % CPULimit : 300
% 0.12/0.39 % WCLimit : 300
% 0.12/0.39 % DateTime : Mon Sep 21 04:56:49 UTC 2026
% 0.12/0.39 % CPUTime :
% 0.12/0.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 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
% 1.06/0.67 % Version: 3.5.1
% 1.06/0.67 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.06/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.06/0.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.06/0.67 % Starting new_bool_3 with 300s (1) cores
% 1.06/0.67 % Starting new_bool_1 with 300s (1) cores
% 1.06/0.67 % Starting sh5l with 300s (1) cores
% 1.06/0.67 % new_bool_3 with pid 3186064 completed with status 9
% 1.06/0.67 % new_bool_1 with pid 3186065 completed with status 9
% 1.06/0.67 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3186063 completed with status 0
% 1.06/0.67 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.06/0.67 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.06/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.06/0.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.06/0.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.06/0.67 % No SInE strategy applied
% 1.06/0.67 % Search class: FGHSM-FFLM31-DFFFFFNN
% 1.06/0.67 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.06/0.67 % Starting SubtermCWHack with 136s (1) cores
% 1.06/0.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.06/0.67 % Starting new_bool_3 with 311s (1) cores
% 1.06/0.67 % Starting new_bool_1 with 308s (1) cores
% 1.06/0.67 % Starting sh5l with 304s (1) cores
% 1.06/0.67 % sh5l with pid 3186075 completed with status 0
% 1.06/0.67 % Result found by sh5l
% 1.06/0.67 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.06/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.06/0.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.06/0.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.06/0.67 % No SInE strategy applied
% 1.06/0.67 % Search class: FGHSM-FFLM31-DFFFFFNN
% 1.06/0.67 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.06/0.67 % Starting SubtermCWHack with 136s (1) cores
% 1.06/0.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.06/0.67 % Starting new_bool_3 with 311s (1) cores
% 1.06/0.67 % Starting new_bool_1 with 308s (1) cores
% 1.06/0.67 % Starting sh5l with 304s (1) cores
% 1.06/0.67 % Preprocessing time : 0.003 s
% 1.06/0.67 % Presaturation interreduction done
% 1.06/0.67
% 1.06/0.67 % Proof found!
% 1.06/0.67 % SZS status Unsatisfiable
% 1.06/0.67 % SZS output start CNFRefutation
% See solution above
% 1.06/0.67 % Parsed axioms : 113
% 1.06/0.67 % Removed by relevancy pruning/SinE : 0
% 1.06/0.67 % Initial clauses : 113
% 1.06/0.67 % Removed in clause preprocessing : 17
% 1.06/0.67 % Initial clauses in saturation : 96
% 1.06/0.67 % Processed clauses : 1005
% 1.06/0.67 % ...of these trivial : 1
% 1.06/0.67 % ...subsumed : 533
% 1.06/0.67 % ...remaining for further processing : 471
% 1.06/0.67 % Other redundant clauses eliminated : 8
% 1.06/0.67 % Clauses deleted for lack of memory : 0
% 1.06/0.67 % Backward-subsumed : 14
% 1.06/0.67 % Backward-rewritten : 79
% 1.06/0.67 % Generated clauses : 3079
% 1.06/0.67 % ...of the previous two non-redundant : 2509
% 1.06/0.67 % ...aggressively subsumed : 0
% 1.06/0.67 % Contextual simplify-reflections : 15
% 1.06/0.67 % Paramodulations : 3067
% 1.06/0.67 % Factorizations : 4
% 1.06/0.67 % NegExts : 0
% 1.06/0.67 % Equation resolutions : 8
% 1.06/0.67 % Disequality decompositions : 0
% 1.06/0.67 % Total rewrite steps : 1798
% 1.06/0.67 % ...of those cached : 1624
% 1.06/0.67 % Propositional unsat checks : 0
% 1.06/0.67 % Propositional check models : 0
% 1.06/0.67 % Propositional check unsatisfiable : 0
% 1.06/0.67 % Propositional clauses : 0
% 1.06/0.67 % Propositional clauses after purity: 0
% 1.06/0.67 % Propositional unsat core size : 0
% 1.06/0.67 % Propositional preprocessing time : 0.000
% 1.06/0.67 % Propositional encoding time : 0.000
% 1.06/0.67 % Propositional solver time : 0.000
% 1.06/0.67 % Success case prop preproc time : 0.000
% 1.06/0.67 % Success case prop encoding time : 0.000
% 1.06/0.67 % Success case prop solver time : 0.000
% 1.06/0.67 % Current number of processed clauses : 279
% 1.06/0.67 % Positive orientable unit clauses : 45
% 1.06/0.67 % Positive unorientable unit clauses: 1
% 1.06/0.67 % Negative unit clauses : 2
% 1.06/0.67 % Non-unit-clauses : 231
% 1.06/0.67 % Current number of unprocessed clauses: 1621
% 1.06/0.67 % ...number of literals in the above : 4754
% 1.06/0.67 % Current number of archived formulas : 0
% 1.06/0.67 % Current number of archived clauses : 205
% 1.06/0.67 % Clause-clause subsumption calls (NU) : 14584
% 1.06/0.67 % Rec. Clause-clause subsumption calls : 8611
% 1.06/0.67 % Non-unit clause-clause subsumptions : 473
% 1.06/0.67 % Unit Clause-clause subsumption calls : 700
% 1.06/0.67 % Rewrite failures with RHS unbound : 0
% 1.06/0.67 % BW rewrite match attempts : 67
% 1.06/0.67 % BW rewrite match successes : 39
% 1.06/0.67 % Condensation attempts : 1005
% 1.06/0.67 % Condensation successes : 17
% 1.06/0.67 % Termbank termtop insertions : 68572
% 1.06/0.67 % Search garbage collected termcells : 185
% 1.06/0.67
% 1.06/0.67 % -------------------------------------------------
% 1.06/0.67 % User time : 0.117 s
% 1.06/0.67 % System time : 0.011 s
% 1.06/0.67 % Total time : 0.128 s
% 1.06/0.67 % Maximum resident set size: 3992 pages
% 1.06/0.67
% 1.06/0.67 % -------------------------------------------------
% 1.06/0.67 % User time : 0.881 s
% 1.06/0.67 % System time : 0.080 s
% 1.06/0.67 % Total time : 0.961 s
% 1.06/0.67 % Maximum resident set size: 4864 pages
% 1.06/0.67 % E exiting
%------------------------------------------------------------------------------