TSTP Solution File: SET935+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET935+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n021.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:55:35 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 44 ( 17 unt; 0 def)
% Number of atoms : 122 ( 35 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 121 ( 43 ~; 56 |; 14 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 79 ( 14 sgn 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_zfmisc_1,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_zfmisc_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',reflexivity_r1_tarski) ).
fof(t82_zfmisc_1,conjecture,
! [X1,X2] :
( set_union2(powerset(X1),powerset(X2)) = powerset(set_union2(X1,X2))
=> inclusion_comparable(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t82_zfmisc_1) ).
fof(d2_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_union2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
| in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_xboole_0) ).
fof(t7_xboole_1,axiom,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_xboole_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k2_xboole_0) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d10_xboole_0) ).
fof(d9_xboole_0,axiom,
! [X1,X2] :
( inclusion_comparable(X1,X2)
<=> ( subset(X1,X2)
| subset(X2,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d9_xboole_0) ).
fof(c_0_8,plain,
! [X4,X5,X6,X6,X4,X5] :
( ( ~ in(X6,X5)
| subset(X6,X4)
| X5 != powerset(X4) )
& ( ~ subset(X6,X4)
| in(X6,X5)
| X5 != powerset(X4) )
& ( ~ in(esk3_2(X4,X5),X5)
| ~ subset(esk3_2(X4,X5),X4)
| X5 = powerset(X4) )
& ( in(esk3_2(X4,X5),X5)
| subset(esk3_2(X4,X5),X4)
| X5 = powerset(X4) ) ),
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)],[d1_zfmisc_1])])])])])])]) ).
fof(c_0_9,plain,
! [X3] : subset(X3,X3),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X2] :
( set_union2(powerset(X1),powerset(X2)) = powerset(set_union2(X1,X2))
=> inclusion_comparable(X1,X2) ),
inference(assume_negation,[status(cth)],[t82_zfmisc_1]) ).
cnf(c_0_11,plain,
( in(X3,X1)
| X1 != powerset(X2)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,negated_conjecture,
( set_union2(powerset(esk1_0),powerset(esk2_0)) = powerset(set_union2(esk1_0,esk2_0))
& ~ inclusion_comparable(esk1_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
fof(c_0_14,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( ~ in(X8,X7)
| in(X8,X5)
| in(X8,X6)
| X7 != set_union2(X5,X6) )
& ( ~ in(X8,X5)
| in(X8,X7)
| X7 != set_union2(X5,X6) )
& ( ~ in(X8,X6)
| in(X8,X7)
| X7 != set_union2(X5,X6) )
& ( ~ in(esk4_3(X5,X6,X7),X5)
| ~ in(esk4_3(X5,X6,X7),X7)
| X7 = set_union2(X5,X6) )
& ( ~ in(esk4_3(X5,X6,X7),X6)
| ~ in(esk4_3(X5,X6,X7),X7)
| X7 = set_union2(X5,X6) )
& ( in(esk4_3(X5,X6,X7),X7)
| in(esk4_3(X5,X6,X7),X5)
| in(esk4_3(X5,X6,X7),X6)
| X7 = set_union2(X5,X6) ) ),
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)],[d2_xboole_0])])])])])])]) ).
cnf(c_0_15,plain,
( in(X1,X2)
| X2 != powerset(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
set_union2(powerset(esk1_0),powerset(esk2_0)) = powerset(set_union2(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( in(X4,X3)
| in(X4,X2)
| X1 != set_union2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( in(set_union2(esk1_0,esk2_0),X1)
| X1 != set_union2(powerset(esk1_0),powerset(esk2_0)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( in(X1,X2)
| in(X1,X3)
| ~ in(X1,set_union2(X3,X2)) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_20,negated_conjecture,
in(set_union2(esk1_0,esk2_0),set_union2(powerset(esk1_0),powerset(esk2_0))),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
( subset(X3,X2)
| X1 != powerset(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,negated_conjecture,
( in(set_union2(esk1_0,esk2_0),powerset(esk1_0))
| in(set_union2(esk1_0,esk2_0),powerset(esk2_0)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
( subset(set_union2(esk1_0,esk2_0),X1)
| in(set_union2(esk1_0,esk2_0),powerset(esk1_0))
| powerset(esk2_0) != powerset(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( subset(set_union2(esk1_0,esk2_0),esk2_0)
| in(set_union2(esk1_0,esk2_0),powerset(esk1_0)) ),
inference(er,[status(thm)],[c_0_23]) ).
fof(c_0_25,plain,
! [X3,X4] : subset(X3,set_union2(X3,X4)),
inference(variable_rename,[status(thm)],[t7_xboole_1]) ).
fof(c_0_26,plain,
! [X3,X4] : set_union2(X3,X4) = set_union2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
fof(c_0_27,plain,
! [X3,X4,X3,X4] :
( ( subset(X3,X4)
| X3 != X4 )
& ( subset(X4,X3)
| X3 != X4 )
& ( ~ subset(X3,X4)
| ~ subset(X4,X3)
| 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)],[d10_xboole_0])])])])]) ).
cnf(c_0_28,negated_conjecture,
( subset(set_union2(esk1_0,esk2_0),esk2_0)
| subset(set_union2(esk1_0,esk2_0),X1)
| powerset(esk1_0) != powerset(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_24]) ).
cnf(c_0_29,plain,
subset(X1,set_union2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,negated_conjecture,
( subset(set_union2(esk1_0,esk2_0),esk1_0)
| subset(set_union2(esk1_0,esk2_0),esk2_0) ),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_33,plain,
subset(X1,set_union2(X2,X1)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
fof(c_0_34,plain,
! [X3,X4,X3,X4] :
( ( ~ inclusion_comparable(X3,X4)
| subset(X3,X4)
| subset(X4,X3) )
& ( ~ subset(X3,X4)
| inclusion_comparable(X3,X4) )
& ( ~ subset(X4,X3)
| inclusion_comparable(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)],[d9_xboole_0])])])])]) ).
cnf(c_0_35,negated_conjecture,
( set_union2(esk1_0,esk2_0) = esk2_0
| subset(set_union2(esk1_0,esk2_0),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_36,negated_conjecture,
~ inclusion_comparable(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_37,plain,
( inclusion_comparable(X1,X2)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( set_union2(esk1_0,esk2_0) = esk2_0
| set_union2(esk1_0,esk2_0) = esk1_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_35]),c_0_29])]) ).
cnf(c_0_39,negated_conjecture,
~ subset(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
( inclusion_comparable(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_41,negated_conjecture,
set_union2(esk1_0,esk2_0) = esk1_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_38]),c_0_39]) ).
cnf(c_0_42,negated_conjecture,
~ subset(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_36,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_41]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET935+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n021.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jul 9 23:20:07 EDT 2022
% 0.18/0.34 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41 # Preprocessing time : 0.015 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 : 44
% 0.24/1.41 # Proof object clause steps : 27
% 0.24/1.41 # Proof object formula steps : 17
% 0.24/1.41 # Proof object conjectures : 18
% 0.24/1.41 # Proof object clause conjectures : 15
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 11
% 0.24/1.41 # Proof object initial formulas used : 8
% 0.24/1.41 # Proof object generating inferences : 16
% 0.24/1.41 # Proof object simplifying inferences : 6
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 16
% 0.24/1.41 # Removed by relevancy pruning/SinE : 4
% 0.24/1.41 # Initial clauses : 25
% 0.24/1.41 # Removed in clause preprocessing : 0
% 0.24/1.41 # Initial clauses in saturation : 25
% 0.24/1.41 # Processed clauses : 149
% 0.24/1.41 # ...of these trivial : 3
% 0.24/1.41 # ...subsumed : 66
% 0.24/1.41 # ...remaining for further processing : 80
% 0.24/1.41 # Other redundant clauses eliminated : 5
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 0
% 0.24/1.41 # Backward-rewritten : 19
% 0.24/1.41 # Generated clauses : 285
% 0.24/1.41 # ...of the previous two non-trivial : 214
% 0.24/1.41 # Contextual simplify-reflections : 0
% 0.24/1.41 # Paramodulations : 252
% 0.24/1.41 # Factorizations : 13
% 0.24/1.41 # Equation resolutions : 20
% 0.24/1.41 # Current number of processed clauses : 59
% 0.24/1.41 # Positive orientable unit clauses : 11
% 0.24/1.41 # Positive unorientable unit clauses: 1
% 0.24/1.41 # Negative unit clauses : 8
% 0.24/1.41 # Non-unit-clauses : 39
% 0.24/1.41 # Current number of unprocessed clauses: 67
% 0.24/1.41 # ...number of literals in the above : 182
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 19
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 751
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 665
% 0.24/1.41 # Non-unit clause-clause subsumptions : 46
% 0.24/1.41 # Unit Clause-clause subsumption calls : 67
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 14
% 0.24/1.41 # BW rewrite match successes : 9
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 3836
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.021 s
% 0.24/1.41 # System time : 0.002 s
% 0.24/1.41 # Total time : 0.023 s
% 0.24/1.41 # Maximum resident set size: 3040 pages
%------------------------------------------------------------------------------