%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET175+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:49 PM UTC 2026
% Result : Theorem 1.23s 0.76s
% Output : CNFRefutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 6 unt; 0 def)
% Number of atoms : 74 ( 19 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 71 ( 22 ~; 37 |; 8 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 61 ( 6 sgn 25 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(union_defn,axiom,
! [X1,X2,X3] :
( member(X3,union(X1,X2))
<=> ( member(X3,X2)
| member(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_defn) ).
fof(equal_member_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ! [X3] :
( member(X3,X1)
<=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_member_defn) ).
fof(intersection_defn,axiom,
! [X1,X2,X3] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X2)
& member(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).
fof(prove_absorbtion_for_union,conjecture,
! [X1,X2] : union(X1,intersection(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_absorbtion_for_union) ).
fof(c_0_4,plain,
! [X4,X5,X6] :
( ( member(X6,union(X4,X5))
| ~ member(X6,X5) )
& ( member(X6,union(X4,X5))
| ~ member(X6,X4) )
& ( member(X6,X5)
| member(X6,X4)
| ~ member(X6,union(X4,X5)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union_defn])])])]) ).
fof(c_0_5,plain,
! [X23,X24,X25,X26,X27,X28] :
( ( X27 = X28
| member(esk2_2(X27,X28),X28)
| member(esk2_2(X27,X28),X27) )
& ( X27 = X28
| ~ member(esk2_2(X27,X28),X28)
| ~ member(esk2_2(X27,X28),X27) )
& ( X23 != X24
| member(X26,X23)
| ~ member(X26,X24) )
& ( X23 != X24
| member(X25,X24)
| ~ member(X25,X23) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_member_defn])])])])])])]) ).
cnf(c_0_6,plain,
( ~ member(X1,union(X2,X3))
| member(X1,X3)
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( X1 = X2
| member(esk2_2(X1,X2),X2)
| member(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( ~ member(X1,X2)
| member(X1,union(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( member(esk2_2(union(X1,X2),X3),X2)
| member(esk2_2(union(X1,X2),X3),X1)
| member(esk2_2(union(X1,X2),X3),X3)
| union(X1,X2) = X3 ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( member(esk2_2(X1,X2),X1)
| member(esk2_2(X1,X2),union(X2,X3))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
fof(c_0_11,plain,
! [X7,X8,X9] :
( ( member(X9,intersection(X7,X8))
| ~ member(X9,X8)
| ~ member(X9,X7) )
& ( ~ member(X9,intersection(X7,X8))
| member(X9,X8) )
& ( ~ member(X9,intersection(X7,X8))
| member(X9,X7) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection_defn])])])]) ).
cnf(c_0_12,plain,
( ~ member(esk2_2(X1,X2),X2)
| ~ member(esk2_2(X1,X2),X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
( member(esk2_2(union(X1,X2),X1),X1)
| member(esk2_2(union(X1,X2),X1),X2)
| union(X1,X2) = X1 ),
inference(ef,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( member(esk2_2(union(X1,X2),X1),union(X1,X2))
| union(X1,X2) = X1 ),
inference(ef,[status(thm)],[c_0_10]) ).
fof(c_0_15,negated_conjecture,
~ ! [X1,X2] : union(X1,intersection(X1,X2)) = X1,
inference(assume_negation,[status(cth)],[prove_absorbtion_for_union]) ).
cnf(c_0_16,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( member(esk2_2(union(X1,X2),X1),X2)
| union(X1,X2) = X1 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_18,plain,
( ~ member(X1,X2)
| member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_19,negated_conjecture,
union(esk3_0,intersection(esk3_0,esk4_0)) != esk3_0,
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
cnf(c_0_20,plain,
( member(esk2_2(union(X1,intersection(X2,X3)),X1),X2)
| union(X1,intersection(X2,X3)) = X1 ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( member(esk2_2(union(X1,X2),X1),union(X3,X2))
| union(X1,X2) = X1 ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_22,negated_conjecture,
union(esk3_0,intersection(esk3_0,esk4_0)) != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
union(X1,intersection(X1,X2)) = X1,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,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.03 % Problem : SET175+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.46 % Computer : n004.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 04:58:34 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.53 Running first-order theorem proving
% 0.23/0.53 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
% 1.23/0.76 % Version: 3.5.1
% 1.23/0.76 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.23/0.76 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.23/0.76 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.23/0.76 % Starting new_bool_3 with 300s (1) cores
% 1.23/0.76 % Starting new_bool_1 with 300s (1) cores
% 1.23/0.76 % Starting sh5l with 300s (1) cores
% 1.23/0.76 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2297497 completed with status 0
% 1.23/0.76 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.23/0.76 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.23/0.76 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.23/0.76 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.23/0.76 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.23/0.76 % No SInE strategy applied
% 1.23/0.76 % Search class: FGUSS-FFSF22-SFFFFFNN
% 1.23/0.76 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.23/0.76 % Starting SubtermCWHack with 136s (1) cores
% 1.23/0.76 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.23/0.76 % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.23/0.76 % Starting new_bool_3 with 136s (1) cores
% 1.23/0.76 % Starting new_bool_1 with 136s (1) cores
% 1.23/0.76 % new_bool_3 with pid 2297506 completed with status 0
% 1.23/0.76 % Result found by new_bool_3
% 1.23/0.76 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.23/0.76 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.23/0.76 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.23/0.76 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.23/0.76 % No SInE strategy applied
% 1.23/0.76 % Search class: FGUSS-FFSF22-SFFFFFNN
% 1.23/0.76 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.23/0.76 % Starting SubtermCWHack with 136s (1) cores
% 1.23/0.76 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.23/0.76 % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.23/0.76 % Starting new_bool_3 with 136s (1) cores
% 1.23/0.76 % Preprocessing time : 0.001 s
% 1.23/0.76 % Presaturation interreduction done
% 1.23/0.76
% 1.23/0.76 % Proof found!
% 1.23/0.76 % SZS status Theorem
% 1.23/0.76 % SZS output start CNFRefutation
% See solution above
% 1.23/0.76 % Parsed axioms : 9
% 1.23/0.76 % Removed by relevancy pruning/SinE : 0
% 1.23/0.76 % Initial clauses : 20
% 1.23/0.76 % Removed in clause preprocessing : 2
% 1.23/0.76 % Initial clauses in saturation : 18
% 1.23/0.76 % Processed clauses : 1111
% 1.23/0.76 % ...of these trivial : 24
% 1.23/0.76 % ...subsumed : 858
% 1.23/0.76 % ...remaining for further processing : 229
% 1.23/0.76 % Other redundant clauses eliminated : 2
% 1.23/0.76 % Clauses deleted for lack of memory : 0
% 1.23/0.76 % Backward-subsumed : 3
% 1.23/0.76 % Backward-rewritten : 9
% 1.23/0.76 % Generated clauses : 5959
% 1.23/0.76 % ...of the previous two non-redundant : 5665
% 1.23/0.76 % ...aggressively subsumed : 0
% 1.23/0.76 % Contextual simplify-reflections : 2
% 1.23/0.76 % Paramodulations : 5831
% 1.23/0.76 % Factorizations : 126
% 1.23/0.76 % NegExts : 0
% 1.23/0.76 % Equation resolutions : 2
% 1.23/0.76 % Disequality decompositions : 0
% 1.23/0.76 % Total rewrite steps : 711
% 1.23/0.76 % ...of those cached : 598
% 1.23/0.76 % Propositional unsat checks : 0
% 1.23/0.76 % Propositional check models : 0
% 1.23/0.76 % Propositional check unsatisfiable : 0
% 1.23/0.76 % Propositional clauses : 0
% 1.23/0.76 % Propositional clauses after purity: 0
% 1.23/0.76 % Propositional unsat core size : 0
% 1.23/0.76 % Propositional preprocessing time : 0.000
% 1.23/0.76 % Propositional encoding time : 0.000
% 1.23/0.76 % Propositional solver time : 0.000
% 1.23/0.76 % Success case prop preproc time : 0.000
% 1.23/0.76 % Success case prop encoding time : 0.000
% 1.23/0.76 % Success case prop solver time : 0.000
% 1.23/0.76 % Current number of processed clauses : 199
% 1.23/0.76 % Positive orientable unit clauses : 24
% 1.23/0.76 % Positive unorientable unit clauses: 2
% 1.23/0.76 % Negative unit clauses : 0
% 1.23/0.76 % Non-unit-clauses : 173
% 1.23/0.76 % Current number of unprocessed clauses: 4545
% 1.23/0.76 % ...number of literals in the above : 13951
% 1.23/0.76 % Current number of archived formulas : 0
% 1.23/0.76 % Current number of archived clauses : 28
% 1.23/0.76 % Clause-clause subsumption calls (NU) : 8213
% 1.23/0.76 % Rec. Clause-clause subsumption calls : 5837
% 1.23/0.76 % Non-unit clause-clause subsumptions : 863
% 1.23/0.76 % Unit Clause-clause subsumption calls : 178
% 1.23/0.76 % Rewrite failures with RHS unbound : 0
% 1.23/0.76 % BW rewrite match attempts : 64
% 1.23/0.76 % BW rewrite match successes : 16
% 1.23/0.76 % Condensation attempts : 0
% 1.23/0.76 % Condensation successes : 0
% 1.23/0.76 % Termbank termtop insertions : 84467
% 1.23/0.76 % Search garbage collected termcells : 305
% 1.23/0.76
% 1.23/0.76 % -------------------------------------------------
% 1.23/0.76 % User time : 0.161 s
% 1.23/0.76 % System time : 0.014 s
% 1.23/0.76 % Total time : 0.175 s
% 1.23/0.76 % Maximum resident set size: 3632 pages
% 1.23/0.76
% 1.23/0.76 % -------------------------------------------------
% 1.23/0.76 % User time : 0.650 s
% 1.23/0.76 % System time : 0.045 s
% 1.23/0.76 % Total time : 0.696 s
% 1.23/0.76 % Maximum resident set size: 4864 pages
% 1.23/0.76 % E exiting
%------------------------------------------------------------------------------