%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET012-1 : 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 : n020.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:01 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.48s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of clauses : 25 ( 7 unt; 6 nHn; 16 RR)
% Number of literals : 46 ( 0 equ; 21 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(not_member_of_set_and_complement,axiom,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET002-0.ax',not_member_of_set_and_complement) ).
cnf(subsets_axiom1,axiom,
( member(member_of_1_not_of_2(X1,X2),X1)
| subset(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET002-0.ax',subsets_axiom1) ).
cnf(subsets_axiom2,axiom,
( ~ member(member_of_1_not_of_2(X1,X2),X2)
| subset(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET002-0.ax',subsets_axiom2) ).
cnf(member_of_set_or_complement,axiom,
( member(X1,complement(X2))
| member(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET002-0.ax',member_of_set_or_complement) ).
cnf(subsets_are_set_equal_sets,axiom,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| equal_sets(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET002-0.ax',subsets_are_set_equal_sets) ).
cnf(prove_involution,negated_conjecture,
~ equal_sets(complement(complement(a)),a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_involution) ).
cnf(c_0_6,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
inference(fof_simplification,[status(thm)],[not_member_of_set_and_complement]) ).
cnf(c_0_7,plain,
( ~ member(X1,complement(X2))
| ~ member(X1,X2) ),
c_0_6 ).
cnf(c_0_8,axiom,
( member(member_of_1_not_of_2(X1,X2),X1)
| subset(X1,X2) ),
subsets_axiom1 ).
cnf(c_0_9,plain,
( ~ member(member_of_1_not_of_2(X1,X2),X2)
| subset(X1,X2) ),
inference(fof_simplification,[status(thm)],[subsets_axiom2]) ).
cnf(c_0_10,plain,
( ~ member(member_of_1_not_of_2(complement(X1),X2),X1)
| subset(complement(X1),X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,axiom,
( member(X1,complement(X2))
| member(X1,X2) ),
member_of_set_or_complement ).
cnf(c_0_12,plain,
( ~ member(member_of_1_not_of_2(X1,X2),X2)
| subset(X1,X2) ),
c_0_9 ).
cnf(c_0_13,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| equal_sets(X2,X1) ),
inference(fof_simplification,[status(thm)],[subsets_are_set_equal_sets]) ).
cnf(c_0_14,plain,
( member(member_of_1_not_of_2(complement(complement(X1)),X2),X1)
| subset(complement(complement(X1)),X2) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( member(member_of_1_not_of_2(X1,complement(X2)),X2)
| subset(X1,complement(X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_16,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| equal_sets(X2,X1) ),
c_0_13 ).
cnf(c_0_17,plain,
subset(complement(complement(X1)),X1),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_18,plain,
( ~ member(member_of_1_not_of_2(X1,complement(complement(X2))),X2)
| subset(X1,complement(complement(X2))) ),
inference(spm,[status(thm)],[c_0_7,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
~ equal_sets(complement(complement(a)),a),
inference(fof_simplification,[status(thm)],[prove_involution]) ).
cnf(c_0_20,plain,
( ~ subset(X1,complement(complement(X1)))
| equal_sets(complement(complement(X1)),X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
subset(X1,complement(complement(X1))),
inference(spm,[status(thm)],[c_0_18,c_0_8]) ).
cnf(c_0_22,negated_conjecture,
~ equal_sets(complement(complement(a)),a),
c_0_19 ).
cnf(c_0_23,plain,
equal_sets(complement(complement(X1)),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET012-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n020.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 04:42:32 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.41 Running first-order theorem proving
% 0.13/0.41 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.48 % Version: 3.5.1
% 0.13/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.48 % Starting sh5l with 300s (1) cores
% 0.13/0.48 % sh5l with pid 2023197 completed with status 0
% 0.13/0.48 % Result found by sh5l
% 0.13/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.48 % Starting sh5l with 300s (1) cores
% 0.13/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.13/0.48 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.48 % Search class: FGHNF-FFSF21-SFFFFFNN
% 0.13/0.48 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.48 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.48 % SubtermCWHack with pid 2023202 completed with status 0
% 0.13/0.48 % Result found by SubtermCWHack
% 0.13/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.48 % Starting sh5l with 300s (1) cores
% 0.13/0.48 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.13/0.48 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.48 % Search class: FGHNF-FFSF21-SFFFFFNN
% 0.13/0.48 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.48 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.48 % Preprocessing time : 0.002 s
% 0.13/0.48
% 0.13/0.48 % Proof found!
% 0.13/0.48 % SZS status Unsatisfiable
% 0.13/0.48 % SZS output start CNFRefutation
% See solution above
% 0.13/0.48 % Parsed axioms : 22
% 0.13/0.48 % Removed by relevancy pruning/SinE : 4
% 0.13/0.48 % Initial clauses : 18
% 0.13/0.48 % Removed in clause preprocessing : 0
% 0.13/0.48 % Initial clauses in saturation : 18
% 0.13/0.48 % Processed clauses : 82
% 0.13/0.48 % ...of these trivial : 0
% 0.13/0.48 % ...subsumed : 19
% 0.13/0.48 % ...remaining for further processing : 63
% 0.13/0.48 % Other redundant clauses eliminated : 0
% 0.13/0.48 % Clauses deleted for lack of memory : 0
% 0.13/0.48 % Backward-subsumed : 0
% 0.13/0.48 % Backward-rewritten : 2
% 0.13/0.48 % Generated clauses : 201
% 0.13/0.48 % ...of the previous two non-redundant : 179
% 0.13/0.48 % ...aggressively subsumed : 0
% 0.13/0.48 % Contextual simplify-reflections : 0
% 0.13/0.48 % Paramodulations : 201
% 0.13/0.48 % Factorizations : 0
% 0.13/0.48 % NegExts : 0
% 0.13/0.48 % Equation resolutions : 0
% 0.13/0.48 % Disequality decompositions : 0
% 0.13/0.48 % Total rewrite steps : 8
% 0.13/0.48 % ...of those cached : 1
% 0.13/0.48 % Propositional unsat checks : 0
% 0.13/0.48 % Propositional check models : 0
% 0.13/0.48 % Propositional check unsatisfiable : 0
% 0.13/0.48 % Propositional clauses : 0
% 0.13/0.48 % Propositional clauses after purity: 0
% 0.13/0.48 % Propositional unsat core size : 0
% 0.13/0.48 % Propositional preprocessing time : 0.000
% 0.13/0.48 % Propositional encoding time : 0.000
% 0.13/0.48 % Propositional solver time : 0.000
% 0.13/0.48 % Success case prop preproc time : 0.000
% 0.13/0.48 % Success case prop encoding time : 0.000
% 0.13/0.48 % Success case prop solver time : 0.000
% 0.13/0.48 % Current number of processed clauses : 61
% 0.13/0.48 % Positive orientable unit clauses : 17
% 0.13/0.48 % Positive unorientable unit clauses: 0
% 0.13/0.48 % Negative unit clauses : 0
% 0.13/0.48 % Non-unit-clauses : 44
% 0.13/0.48 % Current number of unprocessed clauses: 115
% 0.13/0.48 % ...number of literals in the above : 245
% 0.13/0.48 % Current number of archived formulas : 0
% 0.13/0.48 % Current number of archived clauses : 2
% 0.13/0.48 % Clause-clause subsumption calls (NU) : 165
% 0.13/0.48 % Rec. Clause-clause subsumption calls : 164
% 0.13/0.48 % Non-unit clause-clause subsumptions : 19
% 0.13/0.48 % Unit Clause-clause subsumption calls : 15
% 0.13/0.48 % Rewrite failures with RHS unbound : 0
% 0.13/0.48 % BW rewrite match attempts : 22
% 0.13/0.48 % BW rewrite match successes : 2
% 0.13/0.48 % Condensation attempts : 0
% 0.13/0.48 % Condensation successes : 0
% 0.13/0.48 % Termbank termtop insertions : 3082
% 0.13/0.48 % Search garbage collected termcells : 51
% 0.13/0.48
% 0.13/0.48 % -------------------------------------------------
% 0.13/0.48 % User time : 0.012 s
% 0.13/0.48 % System time : 0.003 s
% 0.13/0.48 % Total time : 0.015 s
% 0.13/0.48 % Maximum resident set size: 3648 pages
% 0.13/0.48
% 0.13/0.48 % -------------------------------------------------
% 0.13/0.48 % User time : 0.013 s
% 0.13/0.48 % System time : 0.007 s
% 0.13/0.48 % Total time : 0.020 s
% 0.13/0.48 % Maximum resident set size: 4864 pages
% 0.13/0.48 % E exiting
%------------------------------------------------------------------------------