TSTP Solution File: SET701+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET701+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n013.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:14 EDT 2022
% Result : Theorem 0.26s 10.45s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of formulae : 40 ( 5 unt; 0 def)
% Number of atoms : 114 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 109 ( 35 ~; 53 |; 13 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 88 ( 20 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thI35,conjecture,
! [X1,X2,X6,X4] :
( ( subset(X1,X4)
& subset(X2,X4) )
=> ( subset(X1,X2)
<=> subset(intersection(X1,difference(X4,X2)),intersection(X6,difference(X4,X6))) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thI35) ).
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(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_4,negated_conjecture,
~ ! [X1,X2,X6,X4] :
( ( subset(X1,X4)
& subset(X2,X4) )
=> ( subset(X1,X2)
<=> subset(intersection(X1,difference(X4,X2)),intersection(X6,difference(X4,X6))) ) ),
inference(assume_negation,[status(cth)],[thI35]) ).
fof(c_0_5,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ member(X6,X4)
| member(X6,X5) )
& ( member(esk5_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ member(esk5_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])])])])])])]) ).
fof(c_0_6,negated_conjecture,
( subset(esk1_0,esk4_0)
& subset(esk2_0,esk4_0)
& ( ~ subset(esk1_0,esk2_0)
| ~ subset(intersection(esk1_0,difference(esk4_0,esk2_0)),intersection(esk3_0,difference(esk4_0,esk3_0))) )
& ( subset(esk1_0,esk2_0)
| subset(intersection(esk1_0,difference(esk4_0,esk2_0)),intersection(esk3_0,difference(esk4_0,esk3_0))) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_7,plain,
( member(X1,X2)
| ~ member(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( subset(intersection(esk1_0,difference(esk4_0,esk2_0)),intersection(esk3_0,difference(esk4_0,esk3_0)))
| subset(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,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_10,negated_conjecture,
( member(X1,intersection(esk3_0,difference(esk4_0,esk3_0)))
| subset(esk1_0,esk2_0)
| ~ member(X1,intersection(esk1_0,difference(esk4_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
( subset(X1,X2)
| member(esk5_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_12,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_13,plain,
( member(X1,X3)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( member(esk5_2(intersection(esk1_0,difference(esk4_0,esk2_0)),X1),intersection(esk3_0,difference(esk4_0,esk3_0)))
| subset(intersection(esk1_0,difference(esk4_0,esk2_0)),X1)
| subset(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( ~ member(X1,difference(X2,X3))
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( member(esk5_2(intersection(esk1_0,difference(esk4_0,esk2_0)),X1),difference(esk4_0,esk3_0))
| subset(intersection(esk1_0,difference(esk4_0,esk2_0)),X1)
| subset(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( member(esk5_2(intersection(esk1_0,difference(esk4_0,esk2_0)),X1),esk3_0)
| subset(intersection(esk1_0,difference(esk4_0,esk2_0)),X1)
| subset(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( subset(intersection(esk1_0,difference(esk4_0,esk2_0)),X1)
| subset(esk1_0,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( member(X1,X2)
| subset(esk1_0,esk2_0)
| ~ member(X1,intersection(esk1_0,difference(esk4_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_7,c_0_19]) ).
cnf(c_0_21,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
subset(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,negated_conjecture,
( member(X1,X2)
| subset(esk1_0,esk2_0)
| ~ member(X1,difference(esk4_0,esk2_0))
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( member(X1,difference(X2,X3))
| member(X1,X3)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,negated_conjecture,
( member(X1,esk4_0)
| ~ member(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( member(X1,esk2_0)
| member(X1,X2)
| ~ member(X1,esk1_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_7]) ).
cnf(c_0_27,plain,
( subset(X1,X2)
| ~ member(esk5_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_28,negated_conjecture,
( member(esk5_2(esk1_0,X1),esk2_0)
| member(esk5_2(esk1_0,X1),X2)
| subset(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_11]) ).
cnf(c_0_29,plain,
( member(esk5_2(intersection(X1,X2),X3),X1)
| subset(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_30,negated_conjecture,
( member(esk5_2(esk1_0,esk2_0),X1)
| subset(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
( member(esk5_2(intersection(X1,X2),X3),X2)
| subset(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_32,negated_conjecture,
( member(esk5_2(intersection(esk1_0,X1),X2),esk2_0)
| member(esk5_2(intersection(esk1_0,X1),X2),X3)
| subset(intersection(esk1_0,X1),X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( ~ subset(intersection(esk1_0,difference(esk4_0,esk2_0)),intersection(esk3_0,difference(esk4_0,esk3_0)))
| ~ subset(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_34,negated_conjecture,
subset(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_27,c_0_30]) ).
cnf(c_0_35,plain,
( subset(intersection(X1,difference(X2,X3)),X4)
| ~ member(esk5_2(intersection(X1,difference(X2,X3)),X4),X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( member(esk5_2(intersection(esk1_0,X1),X2),esk2_0)
| subset(intersection(esk1_0,X1),X2) ),
inference(ef,[status(thm)],[c_0_32]) ).
cnf(c_0_37,negated_conjecture,
~ subset(intersection(esk1_0,difference(esk4_0,esk2_0)),intersection(esk3_0,difference(esk4_0,esk3_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_38,negated_conjecture,
subset(intersection(esk1_0,difference(X1,esk2_0)),X2),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET701+4 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n013.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 : Sat Jul 9 21:00:14 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.26/10.45 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/10.45 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/10.45 # Preprocessing time : 0.015 s
% 0.26/10.45
% 0.26/10.45 # Proof found!
% 0.26/10.45 # SZS status Theorem
% 0.26/10.45 # SZS output start CNFRefutation
% See solution above
% 0.26/10.45 # Proof object total steps : 40
% 0.26/10.45 # Proof object clause steps : 31
% 0.26/10.45 # Proof object formula steps : 9
% 0.26/10.45 # Proof object conjectures : 23
% 0.26/10.45 # Proof object clause conjectures : 20
% 0.26/10.45 # Proof object formula conjectures : 3
% 0.26/10.45 # Proof object initial clauses used : 11
% 0.26/10.45 # Proof object initial formulas used : 4
% 0.26/10.45 # Proof object generating inferences : 18
% 0.26/10.45 # Proof object simplifying inferences : 7
% 0.26/10.45 # Training examples: 0 positive, 0 negative
% 0.26/10.45 # Parsed axioms : 12
% 0.26/10.45 # Removed by relevancy pruning/SinE : 8
% 0.26/10.45 # Initial clauses : 13
% 0.26/10.45 # Removed in clause preprocessing : 0
% 0.26/10.45 # Initial clauses in saturation : 13
% 0.26/10.45 # Processed clauses : 9630
% 0.26/10.45 # ...of these trivial : 633
% 0.26/10.45 # ...subsumed : 2144
% 0.26/10.45 # ...remaining for further processing : 6853
% 0.26/10.45 # Other redundant clauses eliminated : 0
% 0.26/10.45 # Clauses deleted for lack of memory : 261730
% 0.26/10.45 # Backward-subsumed : 48
% 0.26/10.45 # Backward-rewritten : 1202
% 0.26/10.45 # Generated clauses : 455216
% 0.26/10.45 # ...of the previous two non-trivial : 449106
% 0.26/10.45 # Contextual simplify-reflections : 214
% 0.26/10.45 # Paramodulations : 455198
% 0.26/10.45 # Factorizations : 18
% 0.26/10.45 # Equation resolutions : 0
% 0.26/10.45 # Current number of processed clauses : 5603
% 0.26/10.45 # Positive orientable unit clauses : 3605
% 0.26/10.45 # Positive unorientable unit clauses: 0
% 0.26/10.45 # Negative unit clauses : 4
% 0.26/10.45 # Non-unit-clauses : 1994
% 0.26/10.45 # Current number of unprocessed clauses: 112330
% 0.26/10.45 # ...number of literals in the above : 193884
% 0.26/10.45 # Current number of archived formulas : 0
% 0.26/10.45 # Current number of archived clauses : 1250
% 0.26/10.45 # Clause-clause subsumption calls (NU) : 344694
% 0.26/10.45 # Rec. Clause-clause subsumption calls : 338243
% 0.26/10.45 # Non-unit clause-clause subsumptions : 2355
% 0.26/10.45 # Unit Clause-clause subsumption calls : 341758
% 0.26/10.45 # Rewrite failures with RHS unbound : 0
% 0.26/10.45 # BW rewrite match attempts : 275610
% 0.26/10.45 # BW rewrite match successes : 1125
% 0.26/10.45 # Condensation attempts : 0
% 0.26/10.45 # Condensation successes : 0
% 0.26/10.45 # Termbank termtop insertions : 9198343
% 0.26/10.45
% 0.26/10.45 # -------------------------------------------------
% 0.26/10.45 # User time : 9.294 s
% 0.26/10.45 # System time : 0.110 s
% 0.26/10.45 # Total time : 9.404 s
% 0.26/10.45 # Maximum resident set size: 138680 pages
% 0.26/23.40 eprover: CPU time limit exceeded, terminating
% 0.26/23.40 eprover: CPU time limit exceeded, terminating
% 0.26/23.41 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.41 eprover: No such file or directory
% 0.26/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.42 eprover: No such file or directory
% 0.26/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.42 eprover: No such file or directory
% 0.26/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.42 eprover: No such file or directory
% 0.26/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.42 eprover: No such file or directory
% 0.26/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.43 eprover: No such file or directory
% 0.26/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.43 eprover: No such file or directory
% 0.26/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.43 eprover: No such file or directory
% 0.26/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.43 eprover: No such file or directory
% 0.26/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.44 eprover: No such file or directory
% 0.26/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.44 eprover: No such file or directory
% 0.26/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.44 eprover: No such file or directory
% 0.26/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.45 eprover: No such file or directory
% 0.26/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.45 eprover: No such file or directory
% 0.26/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.45 eprover: No such file or directory
% 0.26/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.45 eprover: No such file or directory
% 0.26/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.45 eprover: No such file or directory
% 0.26/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.46 eprover: No such file or directory
% 0.26/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.46 eprover: No such file or directory
% 0.26/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.26/23.46 eprover: No such file or directory
% 0.26/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.46 eprover: No such file or directory
% 0.26/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.47 eprover: No such file or directory
%------------------------------------------------------------------------------