TSTP Solution File: SEU114+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU114+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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 09:16:52 EDT 2022
% Result : Theorem 0.25s 3.44s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 41 ( 9 unt; 0 def)
% Number of atoms : 132 ( 23 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 150 ( 59 ~; 66 |; 13 &)
% ( 5 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 78 ( 8 sgn 41 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t3_subset) ).
fof(t1_subset,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t1_subset) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d3_tarski) ).
fof(cc2_finset_1,axiom,
! [X1] :
( finite(X1)
=> ! [X2] :
( element(X2,powerset(X1))
=> finite(X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',cc2_finset_1) ).
fof(d5_finsub_1,axiom,
! [X1,X2] :
( preboolean(X2)
=> ( X2 = finite_subsets(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ( subset(X3,X1)
& finite(X3) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d5_finsub_1) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',d10_xboole_0) ).
fof(t26_finsub_1,axiom,
! [X1] : subset(finite_subsets(X1),powerset(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t26_finsub_1) ).
fof(dt_k5_finsub_1,axiom,
! [X1] : preboolean(finite_subsets(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',dt_k5_finsub_1) ).
fof(t27_finsub_1,conjecture,
! [X1] :
( finite(X1)
=> finite_subsets(X1) = powerset(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',t27_finsub_1) ).
fof(c_0_9,plain,
! [X3,X4,X3,X4] :
( ( ~ element(X3,powerset(X4))
| subset(X3,X4) )
& ( ~ subset(X3,X4)
| element(X3,powerset(X4)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])])]) ).
fof(c_0_10,plain,
! [X3,X4] :
( ~ in(X3,X4)
| element(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).
cnf(c_0_11,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk1_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk1_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)],[d3_tarski])])])])])])]) ).
fof(c_0_14,plain,
! [X3,X4] :
( ~ finite(X3)
| ~ element(X4,powerset(X3))
| finite(X4) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_finset_1])])])])]) ).
fof(c_0_15,plain,
! [X4,X5,X6,X6] :
( ( subset(X6,X4)
| ~ in(X6,X5)
| X5 != finite_subsets(X4)
| ~ preboolean(X5) )
& ( finite(X6)
| ~ in(X6,X5)
| X5 != finite_subsets(X4)
| ~ preboolean(X5) )
& ( ~ subset(X6,X4)
| ~ finite(X6)
| in(X6,X5)
| X5 != finite_subsets(X4)
| ~ preboolean(X5) )
& ( ~ in(esk2_2(X4,X5),X5)
| ~ subset(esk2_2(X4,X5),X4)
| ~ finite(esk2_2(X4,X5))
| X5 = finite_subsets(X4)
| ~ preboolean(X5) )
& ( subset(esk2_2(X4,X5),X4)
| in(esk2_2(X4,X5),X5)
| X5 = finite_subsets(X4)
| ~ preboolean(X5) )
& ( finite(esk2_2(X4,X5))
| in(esk2_2(X4,X5),X5)
| X5 = finite_subsets(X4)
| ~ preboolean(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)],[d5_finsub_1])])])])])])]) ).
cnf(c_0_16,plain,
( subset(X1,X2)
| ~ in(X1,powerset(X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
( finite(X1)
| ~ element(X1,powerset(X2))
| ~ finite(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( in(X3,X1)
| ~ preboolean(X1)
| X1 != finite_subsets(X2)
| ~ finite(X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( subset(esk1_2(powerset(X1),X2),X1)
| subset(powerset(X1),X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( finite(X1)
| ~ finite(X2)
| ~ in(X1,powerset(X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_22,plain,
( subset(powerset(X1),X2)
| in(esk1_2(powerset(X1),X2),X3)
| X3 != finite_subsets(X1)
| ~ preboolean(X3)
| ~ finite(esk1_2(powerset(X1),X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( subset(powerset(X1),X2)
| finite(esk1_2(powerset(X1),X2))
| ~ finite(X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
fof(c_0_24,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])])])])]) ).
fof(c_0_25,plain,
! [X2] : subset(finite_subsets(X2),powerset(X2)),
inference(variable_rename,[status(thm)],[t26_finsub_1]) ).
cnf(c_0_26,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_27,plain,
( subset(powerset(X1),X2)
| in(esk1_2(powerset(X1),X2),X3)
| X3 != finite_subsets(X1)
| ~ preboolean(X3)
| ~ finite(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_28,plain,
! [X2] : preboolean(finite_subsets(X2)),
inference(variable_rename,[status(thm)],[dt_k5_finsub_1]) ).
fof(c_0_29,negated_conjecture,
~ ! [X1] :
( finite(X1)
=> finite_subsets(X1) = powerset(X1) ),
inference(assume_negation,[status(cth)],[t27_finsub_1]) ).
cnf(c_0_30,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,plain,
subset(finite_subsets(X1),powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
( subset(powerset(X1),X2)
| X2 != finite_subsets(X1)
| ~ preboolean(X2)
| ~ finite(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,plain,
preboolean(finite_subsets(X1)),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_34,negated_conjecture,
( finite(esk13_0)
& finite_subsets(esk13_0) != powerset(esk13_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])]) ).
cnf(c_0_35,plain,
( finite_subsets(X1) = powerset(X1)
| ~ subset(powerset(X1),finite_subsets(X1)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
( subset(powerset(X1),finite_subsets(X2))
| finite_subsets(X2) != finite_subsets(X1)
| ~ finite(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
finite_subsets(esk13_0) != powerset(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_38,plain,
( finite_subsets(X1) = powerset(X1)
| ~ finite(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
finite(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU114+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 20 07:17:07 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.25/3.44 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.25/3.44 # Preprocessing time : 0.017 s
% 0.25/3.44
% 0.25/3.44 # Proof found!
% 0.25/3.44 # SZS status Theorem
% 0.25/3.44 # SZS output start CNFRefutation
% See solution above
% 0.25/3.44 # Proof object total steps : 41
% 0.25/3.44 # Proof object clause steps : 22
% 0.25/3.44 # Proof object formula steps : 19
% 0.25/3.44 # Proof object conjectures : 6
% 0.25/3.44 # Proof object clause conjectures : 3
% 0.25/3.44 # Proof object formula conjectures : 3
% 0.25/3.44 # Proof object initial clauses used : 11
% 0.25/3.44 # Proof object initial formulas used : 9
% 0.25/3.44 # Proof object generating inferences : 11
% 0.25/3.44 # Proof object simplifying inferences : 2
% 0.25/3.44 # Training examples: 0 positive, 0 negative
% 0.25/3.44 # Parsed axioms : 36
% 0.25/3.44 # Removed by relevancy pruning/SinE : 0
% 0.25/3.44 # Initial clauses : 74
% 0.25/3.44 # Removed in clause preprocessing : 0
% 0.25/3.44 # Initial clauses in saturation : 74
% 0.25/3.44 # Processed clauses : 17098
% 0.25/3.44 # ...of these trivial : 28
% 0.25/3.44 # ...subsumed : 13758
% 0.25/3.44 # ...remaining for further processing : 3312
% 0.25/3.44 # Other redundant clauses eliminated : 2
% 0.25/3.44 # Clauses deleted for lack of memory : 0
% 0.25/3.44 # Backward-subsumed : 295
% 0.25/3.44 # Backward-rewritten : 184
% 0.25/3.44 # Generated clauses : 118414
% 0.25/3.44 # ...of the previous two non-trivial : 105682
% 0.25/3.44 # Contextual simplify-reflections : 10575
% 0.25/3.44 # Paramodulations : 118154
% 0.25/3.44 # Factorizations : 6
% 0.25/3.44 # Equation resolutions : 254
% 0.25/3.44 # Current number of processed clauses : 2831
% 0.25/3.44 # Positive orientable unit clauses : 60
% 0.25/3.44 # Positive unorientable unit clauses: 0
% 0.25/3.44 # Negative unit clauses : 33
% 0.25/3.44 # Non-unit-clauses : 2738
% 0.25/3.44 # Current number of unprocessed clauses: 82856
% 0.25/3.44 # ...number of literals in the above : 407082
% 0.25/3.44 # Current number of archived formulas : 0
% 0.25/3.44 # Current number of archived clauses : 479
% 0.25/3.44 # Clause-clause subsumption calls (NU) : 1986231
% 0.25/3.44 # Rec. Clause-clause subsumption calls : 1092593
% 0.25/3.44 # Non-unit clause-clause subsumptions : 21177
% 0.25/3.44 # Unit Clause-clause subsumption calls : 7821
% 0.25/3.44 # Rewrite failures with RHS unbound : 0
% 0.25/3.44 # BW rewrite match attempts : 28
% 0.25/3.44 # BW rewrite match successes : 19
% 0.25/3.44 # Condensation attempts : 0
% 0.25/3.44 # Condensation successes : 0
% 0.25/3.44 # Termbank termtop insertions : 1851631
% 0.25/3.44
% 0.25/3.44 # -------------------------------------------------
% 0.25/3.44 # User time : 2.268 s
% 0.25/3.44 # System time : 0.050 s
% 0.25/3.44 # Total time : 2.318 s
% 0.25/3.44 # Maximum resident set size: 72700 pages
% 0.25/23.42 eprover: CPU time limit exceeded, terminating
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------