%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET175+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n025.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 00:49:52 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 13 unt; 0 def)
% Number of atoms : 77 ( 26 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 67 ( 21 ~; 34 |; 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 : 77 ( 15 sgn 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(union_defn,axiom,
! [X1,X2,X3] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',union_defn) ).
fof(equal_member_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ! [X3] :
( member(X3,X1)
<=> member(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',equal_member_defn) ).
fof(commutativity_of_union,axiom,
! [X1,X2] : union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',commutativity_of_union) ).
fof(intersection_defn,axiom,
! [X1,X2,X3] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',intersection_defn) ).
fof(prove_absorbtion_for_union,conjecture,
! [X1,X2] : union(X1,intersection(X1,X2)) = X1,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',prove_absorbtion_for_union) ).
fof(commutativity_of_intersection,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',commutativity_of_intersection) ).
fof(c_0_6,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( ~ member(X6,union(X4,X5))
| member(X6,X4)
| member(X6,X5) )
& ( ~ member(X6,X4)
| member(X6,union(X4,X5)) )
& ( ~ member(X6,X5)
| member(X6,union(X4,X5)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union_defn])])])])]) ).
fof(c_0_7,plain,
! [X4,X5,X6,X6,X4,X5] :
( ( ~ member(X6,X4)
| member(X6,X5)
| X4 != X5 )
& ( ~ member(X6,X5)
| member(X6,X4)
| X4 != X5 )
& ( ~ member(esk3_2(X4,X5),X4)
| ~ member(esk3_2(X4,X5),X5)
| X4 = X5 )
& ( member(esk3_2(X4,X5),X4)
| member(esk3_2(X4,X5),X5)
| X4 = X5 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_member_defn])])])])])])]) ).
cnf(c_0_8,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( X1 = X2
| member(esk3_2(X1,X2),X2)
| member(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( X1 = X2
| member(esk3_2(X1,X2),union(X3,X2))
| member(esk3_2(X1,X2),X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( union(X1,X2) = X2
| member(esk3_2(union(X1,X2),X2),union(X1,X2)) ),
inference(ef,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
( X1 = X2
| ~ member(esk3_2(X1,X2),X2)
| ~ member(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( union(X1,X2) = X2
| member(esk3_2(union(X1,X2),X2),X1)
| member(esk3_2(union(X1,X2),X2),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_15,plain,
! [X3,X4] : union(X3,X4) = union(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_of_union]) ).
fof(c_0_16,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( member(X6,X4)
| ~ member(X6,intersection(X4,X5)) )
& ( member(X6,X5)
| ~ member(X6,intersection(X4,X5)) )
& ( ~ member(X6,X4)
| ~ member(X6,X5)
| member(X6,intersection(X4,X5)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection_defn])])])])]) ).
cnf(c_0_17,plain,
( union(X1,X2) = X2
| member(esk3_2(union(X1,X2),X2),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12]) ).
cnf(c_0_18,plain,
union(X1,X2) = union(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
( union(X1,X2) = X1
| member(esk3_2(union(X1,X2),X1),X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_21,negated_conjecture,
~ ! [X1,X2] : union(X1,intersection(X1,X2)) = X1,
inference(assume_negation,[status(cth)],[prove_absorbtion_for_union]) ).
cnf(c_0_22,plain,
( union(intersection(X1,X2),X3) = X3
| member(esk3_2(union(intersection(X1,X2),X3),X3),X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_23,plain,
( union(X1,X2) = X1
| member(esk3_2(union(X1,X2),X1),union(X3,X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_20]) ).
fof(c_0_24,plain,
! [X3,X4] : intersection(X3,X4) = intersection(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).
fof(c_0_25,negated_conjecture,
union(esk1_0,intersection(esk1_0,esk2_0)) != esk1_0,
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
cnf(c_0_26,plain,
union(X1,intersection(X2,X1)) = X1,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_22]),c_0_18]),c_0_18]),c_0_18]),c_0_23]) ).
cnf(c_0_27,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,negated_conjecture,
union(esk1_0,intersection(esk1_0,esk2_0)) != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,plain,
union(X1,intersection(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET175+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.14/0.34 % Computer : n025.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jul 10 11:07:16 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.24/1.41 # Preprocessing time : 0.014 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 31
% 0.24/1.41 # Proof object clause steps : 18
% 0.24/1.41 # Proof object formula steps : 13
% 0.24/1.41 # Proof object conjectures : 5
% 0.24/1.41 # Proof object clause conjectures : 2
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 8
% 0.24/1.41 # Proof object initial formulas used : 6
% 0.24/1.41 # Proof object generating inferences : 9
% 0.24/1.41 # Proof object simplifying inferences : 7
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 9
% 0.24/1.41 # Removed by relevancy pruning/SinE : 3
% 0.24/1.41 # Initial clauses : 13
% 0.24/1.41 # Removed in clause preprocessing : 2
% 0.24/1.41 # Initial clauses in saturation : 11
% 0.24/1.41 # Processed clauses : 4170
% 0.24/1.41 # ...of these trivial : 29
% 0.24/1.41 # ...subsumed : 3391
% 0.24/1.41 # ...remaining for further processing : 750
% 0.24/1.41 # Other redundant clauses eliminated : 0
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 13
% 0.24/1.41 # Backward-rewritten : 18
% 0.24/1.41 # Generated clauses : 97728
% 0.24/1.41 # ...of the previous two non-trivial : 91181
% 0.24/1.41 # Contextual simplify-reflections : 44
% 0.24/1.41 # Paramodulations : 97660
% 0.24/1.41 # Factorizations : 68
% 0.24/1.41 # Equation resolutions : 0
% 0.24/1.41 # Current number of processed clauses : 719
% 0.24/1.41 # Positive orientable unit clauses : 16
% 0.24/1.41 # Positive unorientable unit clauses: 2
% 0.24/1.41 # Negative unit clauses : 0
% 0.24/1.41 # Non-unit-clauses : 701
% 0.24/1.41 # Current number of unprocessed clauses: 85379
% 0.24/1.41 # ...number of literals in the above : 198239
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 31
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 527720
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 362675
% 0.24/1.41 # Non-unit clause-clause subsumptions : 3448
% 0.24/1.41 # Unit Clause-clause subsumption calls : 2450
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 469
% 0.24/1.41 # BW rewrite match successes : 18
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 1842677
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.792 s
% 0.24/1.41 # System time : 0.051 s
% 0.24/1.41 # Total time : 0.843 s
% 0.24/1.41 # Maximum resident set size: 74848 pages
% 0.24/23.40 eprover: CPU time limit exceeded, terminating
% 0.24/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.42 eprover: No such file or directory
% 0.24/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.42 eprover: No such file or directory
% 0.24/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.42 eprover: No such file or directory
% 0.24/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43 eprover: No such file or directory
% 0.24/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43 eprover: No such file or directory
% 0.24/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45 eprover: No such file or directory
%------------------------------------------------------------------------------