TSTP Solution File: SET611+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET611+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n028.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:52:29 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 41 ( 9 unt; 0 def)
% Number of atoms : 100 ( 37 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 98 ( 39 ~; 45 |; 8 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 77 ( 11 sgn 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th84,conjecture,
! [X1,X2] :
( intersection(X1,X2) = empty_set
<=> difference(X1,X2) = X1 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_th84) ).
fof(commutativity_of_intersection,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_of_intersection) ).
fof(empty_set_defn,axiom,
! [X1] : ~ member(X1,empty_set),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',empty_set_defn) ).
fof(member_equal,axiom,
! [X1,X2] :
( ! [X3] :
( member(X3,X1)
<=> member(X3,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',member_equal) ).
fof(difference_defn,axiom,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( member(X3,X1)
& ~ member(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',difference_defn) ).
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.mepo_128.in',intersection_defn) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] :
( intersection(X1,X2) = empty_set
<=> difference(X1,X2) = X1 ),
inference(assume_negation,[status(cth)],[prove_th84]) ).
fof(c_0_7,negated_conjecture,
( ( intersection(esk1_0,esk2_0) != empty_set
| difference(esk1_0,esk2_0) != esk1_0 )
& ( intersection(esk1_0,esk2_0) = empty_set
| difference(esk1_0,esk2_0) = esk1_0 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X3,X4] : intersection(X3,X4) = intersection(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).
fof(c_0_9,plain,
! [X2] : ~ member(X2,empty_set),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[empty_set_defn])]) ).
fof(c_0_10,plain,
! [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(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[member_equal])])])])])]) ).
fof(c_0_11,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( member(X6,X4)
| ~ member(X6,difference(X4,X5)) )
& ( ~ member(X6,X5)
| ~ member(X6,difference(X4,X5)) )
& ( ~ member(X6,X4)
| member(X6,X5)
| member(X6,difference(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)],[inference(fof_simplification,[status(thm)],[difference_defn])])])])])]) ).
cnf(c_0_12,negated_conjecture,
( difference(esk1_0,esk2_0) = esk1_0
| intersection(esk1_0,esk2_0) = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,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_15,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( X1 = X2
| member(esk3_2(X1,X2),X2)
| member(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( ~ member(X1,difference(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
( difference(esk1_0,esk2_0) = esk1_0
| intersection(esk2_0,esk1_0) = empty_set ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( X1 = empty_set
| member(esk3_2(X1,empty_set),X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( intersection(esk2_0,esk1_0) = empty_set
| ~ member(X1,esk1_0)
| ~ member(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( intersection(X1,X2) = empty_set
| member(esk3_2(intersection(X1,X2),empty_set),X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_25,negated_conjecture,
( intersection(esk2_0,esk1_0) = empty_set
| intersection(esk1_0,X1) = empty_set
| ~ member(esk3_2(intersection(esk1_0,X1),empty_set),esk2_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( intersection(X1,X2) = X3
| member(esk3_2(intersection(X1,X2),X3),X3)
| member(esk3_2(intersection(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_16]) ).
cnf(c_0_27,plain,
( difference(X1,X2) = X3
| member(esk3_2(difference(X1,X2),X3),X3)
| member(esk3_2(difference(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_28,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_29,negated_conjecture,
intersection(esk2_0,esk1_0) = empty_set,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_13]),c_0_13])]),c_0_15]) ).
cnf(c_0_30,plain,
( X1 = X2
| ~ member(esk3_2(X1,X2),X2)
| ~ member(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,plain,
( difference(X1,X2) = X1
| member(esk3_2(difference(X1,X2),X1),X1) ),
inference(ef,[status(thm)],[c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( difference(esk1_0,esk2_0) != esk1_0
| intersection(esk1_0,esk2_0) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_33,negated_conjecture,
( ~ member(X1,esk1_0)
| ~ member(X1,esk2_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_15]) ).
cnf(c_0_34,plain,
( difference(X1,X2) = X1
| ~ member(esk3_2(difference(X1,X2),X1),difference(X1,X2)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( member(X1,difference(X2,X3))
| member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_36,negated_conjecture,
( intersection(esk2_0,esk1_0) != empty_set
| difference(esk1_0,esk2_0) != esk1_0 ),
inference(rw,[status(thm)],[c_0_32,c_0_13]) ).
cnf(c_0_37,negated_conjecture,
( difference(esk1_0,X1) = esk1_0
| ~ member(esk3_2(difference(esk1_0,X1),esk1_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_31]) ).
cnf(c_0_38,plain,
( difference(X1,X2) = X1
| member(esk3_2(difference(X1,X2),X1),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_31]) ).
cnf(c_0_39,negated_conjecture,
difference(esk1_0,esk2_0) != esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_29])]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SET611+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 10 14:40:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.015 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 41
% 0.22/1.40 # Proof object clause steps : 28
% 0.22/1.40 # Proof object formula steps : 13
% 0.22/1.40 # Proof object conjectures : 14
% 0.22/1.40 # Proof object clause conjectures : 11
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 12
% 0.22/1.40 # Proof object initial formulas used : 6
% 0.22/1.40 # Proof object generating inferences : 13
% 0.22/1.40 # Proof object simplifying inferences : 11
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 11
% 0.22/1.40 # Removed by relevancy pruning/SinE : 4
% 0.22/1.40 # Initial clauses : 16
% 0.22/1.40 # Removed in clause preprocessing : 2
% 0.22/1.40 # Initial clauses in saturation : 14
% 0.22/1.40 # Processed clauses : 916
% 0.22/1.40 # ...of these trivial : 25
% 0.22/1.40 # ...subsumed : 640
% 0.22/1.40 # ...remaining for further processing : 251
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 5
% 0.22/1.40 # Backward-rewritten : 16
% 0.22/1.40 # Generated clauses : 4025
% 0.22/1.40 # ...of the previous two non-trivial : 2681
% 0.22/1.40 # Contextual simplify-reflections : 67
% 0.22/1.40 # Paramodulations : 3997
% 0.22/1.40 # Factorizations : 28
% 0.22/1.40 # Equation resolutions : 0
% 0.22/1.40 # Current number of processed clauses : 230
% 0.22/1.40 # Positive orientable unit clauses : 22
% 0.22/1.40 # Positive unorientable unit clauses: 1
% 0.22/1.40 # Negative unit clauses : 2
% 0.22/1.40 # Non-unit-clauses : 205
% 0.22/1.40 # Current number of unprocessed clauses: 1727
% 0.22/1.40 # ...number of literals in the above : 3941
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 21
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 7978
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 7151
% 0.22/1.40 # Non-unit clause-clause subsumptions : 563
% 0.22/1.40 # Unit Clause-clause subsumption calls : 351
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 24
% 0.22/1.40 # BW rewrite match successes : 3
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 46921
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.079 s
% 0.22/1.40 # System time : 0.008 s
% 0.22/1.40 # Total time : 0.087 s
% 0.22/1.40 # Maximum resident set size: 4888 pages
% 0.22/23.42 eprover: CPU time limit exceeded, terminating
% 0.22/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.43 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.44 eprover: No such file or directory
% 0.22/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.45 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.46 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.47 eprover: No such file or directory
% 0.22/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.48 eprover: No such file or directory
% 0.22/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.48 eprover: No such file or directory
% 0.22/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.22/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------