TSTP Solution File: SET697+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET697+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.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:53:13 EDT 2022
% Result : Theorem 0.21s 1.41s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 43 ( 9 unt; 0 def)
% Number of atoms : 114 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 117 ( 46 ~; 46 |; 16 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 87 ( 18 sgn 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thI31,conjecture,
! [X1,X2,X4] :
( ( subset(X1,X4)
& subset(X2,X4) )
=> ( subset(X1,X2)
<=> equal_set(intersection(X1,difference(X4,X2)),empty_set) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thI31) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',subset) ).
fof(empty_set,axiom,
! [X3] : ~ member(X3,empty_set),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',empty_set) ).
fof(intersection,axiom,
! [X3,X1,X2] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',intersection) ).
fof(difference,axiom,
! [X2,X1,X4] :
( member(X2,difference(X4,X1))
<=> ( member(X2,X4)
& ~ member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',difference) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X4] :
( ( subset(X1,X4)
& subset(X2,X4) )
=> ( subset(X1,X2)
<=> equal_set(intersection(X1,difference(X4,X2)),empty_set) ) ),
inference(assume_negation,[status(cth)],[thI31]) ).
fof(c_0_7,plain,
! [X3,X4,X3,X4] :
( ( subset(X3,X4)
| ~ equal_set(X3,X4) )
& ( subset(X4,X3)
| ~ equal_set(X3,X4) )
& ( ~ subset(X3,X4)
| ~ subset(X4,X3)
| equal_set(X3,X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])])])]) ).
fof(c_0_8,negated_conjecture,
( subset(esk1_0,esk3_0)
& subset(esk2_0,esk3_0)
& ( ~ subset(esk1_0,esk2_0)
| ~ equal_set(intersection(esk1_0,difference(esk3_0,esk2_0)),empty_set) )
& ( subset(esk1_0,esk2_0)
| equal_set(intersection(esk1_0,difference(esk3_0,esk2_0)),empty_set) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_9,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk4_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ member(esk4_2(X4,X5),X5)
| subset(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)],[subset])])])])])])]) ).
cnf(c_0_10,plain,
( subset(X1,X2)
| ~ equal_set(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( equal_set(intersection(esk1_0,difference(esk3_0,esk2_0)),empty_set)
| subset(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X4] : ~ member(X4,empty_set),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[empty_set])]) ).
cnf(c_0_13,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( subset(intersection(esk1_0,difference(esk3_0,esk2_0)),empty_set)
| subset(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X4,X5,X6,X4,X5,X6] :
( ( member(X4,X5)
| ~ member(X4,intersection(X5,X6)) )
& ( member(X4,X6)
| ~ member(X4,intersection(X5,X6)) )
& ( ~ member(X4,X5)
| ~ member(X4,X6)
| member(X4,intersection(X5,X6)) ) ),
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])])])])]) ).
cnf(c_0_17,negated_conjecture,
( subset(esk1_0,esk2_0)
| ~ member(X1,intersection(esk1_0,difference(esk3_0,esk2_0))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_18,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_19,plain,
! [X5,X6,X7,X5,X6,X7] :
( ( member(X5,X7)
| ~ member(X5,difference(X7,X6)) )
& ( ~ member(X5,X6)
| ~ member(X5,difference(X7,X6)) )
& ( ~ member(X5,X7)
| member(X5,X6)
| member(X5,difference(X7,X6)) ) ),
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])])])])])]) ).
cnf(c_0_20,negated_conjecture,
subset(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,negated_conjecture,
( subset(esk1_0,esk2_0)
| ~ member(X1,difference(esk3_0,esk2_0))
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( member(X1,difference(X2,X3))
| member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( member(X1,esk3_0)
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_24,plain,
( subset(X1,X2)
| member(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_25,negated_conjecture,
( member(X1,esk2_0)
| ~ member(X1,esk1_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_13]) ).
cnf(c_0_26,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_28,negated_conjecture,
( ~ equal_set(intersection(esk1_0,difference(esk3_0,esk2_0)),empty_set)
| ~ subset(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,plain,
( equal_set(X1,X2)
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_30,plain,
subset(empty_set,X1),
inference(spm,[status(thm)],[c_0_15,c_0_24]) ).
cnf(c_0_31,plain,
( subset(X1,X2)
| ~ member(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_32,negated_conjecture,
( member(esk4_2(esk1_0,X1),esk2_0)
| subset(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_33,plain,
( ~ member(X1,difference(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_34,plain,
( member(esk4_2(intersection(X1,X2),X3),X2)
| subset(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_35,plain,
( member(esk4_2(intersection(X1,X2),X3),X1)
| subset(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_36,negated_conjecture,
( ~ subset(intersection(esk1_0,difference(esk3_0,esk2_0)),empty_set)
| ~ subset(esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_37,negated_conjecture,
subset(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
( subset(intersection(X1,difference(X2,X3)),X4)
| ~ member(esk4_2(intersection(X1,difference(X2,X3)),X4),X3) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( member(esk4_2(intersection(esk1_0,X1),X2),esk2_0)
| subset(intersection(esk1_0,X1),X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_35]) ).
cnf(c_0_40,negated_conjecture,
~ subset(intersection(esk1_0,difference(esk3_0,esk2_0)),empty_set),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_41,negated_conjecture,
subset(intersection(esk1_0,difference(X1,esk2_0)),X2),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET697+4 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n023.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 : Mon Jul 11 02:49:10 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.21/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.41 # Preprocessing time : 0.016 s
% 0.21/1.41
% 0.21/1.41 # Proof found!
% 0.21/1.41 # SZS status Theorem
% 0.21/1.41 # SZS output start CNFRefutation
% See solution above
% 0.21/1.41 # Proof object total steps : 43
% 0.21/1.41 # Proof object clause steps : 30
% 0.21/1.41 # Proof object formula steps : 13
% 0.21/1.41 # Proof object conjectures : 18
% 0.21/1.41 # Proof object clause conjectures : 15
% 0.21/1.41 # Proof object formula conjectures : 3
% 0.21/1.41 # Proof object initial clauses used : 14
% 0.21/1.41 # Proof object initial formulas used : 6
% 0.21/1.41 # Proof object generating inferences : 14
% 0.21/1.41 # Proof object simplifying inferences : 9
% 0.21/1.41 # Training examples: 0 positive, 0 negative
% 0.21/1.41 # Parsed axioms : 12
% 0.21/1.41 # Removed by relevancy pruning/SinE : 6
% 0.21/1.41 # Initial clauses : 17
% 0.21/1.41 # Removed in clause preprocessing : 0
% 0.21/1.41 # Initial clauses in saturation : 17
% 0.21/1.41 # Processed clauses : 163
% 0.21/1.41 # ...of these trivial : 0
% 0.21/1.41 # ...subsumed : 22
% 0.21/1.41 # ...remaining for further processing : 141
% 0.21/1.41 # Other redundant clauses eliminated : 0
% 0.21/1.41 # Clauses deleted for lack of memory : 0
% 0.21/1.41 # Backward-subsumed : 1
% 0.21/1.41 # Backward-rewritten : 14
% 0.21/1.41 # Generated clauses : 581
% 0.21/1.41 # ...of the previous two non-trivial : 559
% 0.21/1.41 # Contextual simplify-reflections : 14
% 0.21/1.41 # Paramodulations : 581
% 0.21/1.41 # Factorizations : 0
% 0.21/1.41 # Equation resolutions : 0
% 0.21/1.41 # Current number of processed clauses : 126
% 0.21/1.41 # Positive orientable unit clauses : 58
% 0.21/1.41 # Positive unorientable unit clauses: 0
% 0.21/1.41 # Negative unit clauses : 2
% 0.21/1.41 # Non-unit-clauses : 66
% 0.21/1.41 # Current number of unprocessed clauses: 386
% 0.21/1.41 # ...number of literals in the above : 787
% 0.21/1.41 # Current number of archived formulas : 0
% 0.21/1.41 # Current number of archived clauses : 15
% 0.21/1.41 # Clause-clause subsumption calls (NU) : 421
% 0.21/1.41 # Rec. Clause-clause subsumption calls : 400
% 0.21/1.41 # Non-unit clause-clause subsumptions : 35
% 0.21/1.41 # Unit Clause-clause subsumption calls : 220
% 0.21/1.41 # Rewrite failures with RHS unbound : 0
% 0.21/1.41 # BW rewrite match attempts : 106
% 0.21/1.41 # BW rewrite match successes : 3
% 0.21/1.41 # Condensation attempts : 0
% 0.21/1.41 # Condensation successes : 0
% 0.21/1.41 # Termbank termtop insertions : 9336
% 0.21/1.41
% 0.21/1.41 # -------------------------------------------------
% 0.21/1.41 # User time : 0.033 s
% 0.21/1.41 # System time : 0.001 s
% 0.21/1.41 # Total time : 0.034 s
% 0.21/1.41 # Maximum resident set size: 3608 pages
% 0.21/23.40 eprover: CPU time limit exceeded, terminating
% 0.21/23.41 eprover: CPU time limit exceeded, terminating
% 0.21/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.42 eprover: No such file or directory
% 0.21/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.42 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.43 eprover: No such file or directory
% 0.21/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.44 eprover: No such file or directory
% 0.21/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.44 eprover: No such file or directory
% 0.21/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.44 eprover: No such file or directory
% 0.21/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.44 eprover: No such file or directory
% 0.21/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.45 eprover: No such file or directory
% 0.21/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.45 eprover: No such file or directory
% 0.21/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.45 eprover: No such file or directory
% 0.21/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.45 eprover: No such file or directory
% 0.21/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.45 eprover: No such file or directory
% 0.21/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.46 eprover: No such file or directory
% 0.21/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.46 eprover: No such file or directory
% 0.21/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.21/23.46 eprover: No such file or directory
% 0.21/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.47 eprover: No such file or directory
% 0.21/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.47 eprover: No such file or directory
% 0.21/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.21/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------