TSTP Solution File: SEU094+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU094+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n024.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:47 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 6 unt; 0 def)
% Number of atoms : 88 ( 0 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 92 ( 36 ~; 38 |; 9 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 34 ( 1 sgn 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t25_finset_1,conjecture,
! [X1] :
( ( finite(X1)
& ! [X2] :
( in(X2,X1)
=> finite(X2) ) )
<=> finite(union(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t25_finset_1) ).
fof(l22_finset_1,axiom,
! [X1] :
( ( finite(X1)
& ! [X2] :
( in(X2,X1)
=> finite(X2) ) )
=> finite(union(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l22_finset_1) ).
fof(t13_finset_1,axiom,
! [X1,X2] :
( ( subset(X1,X2)
& finite(X2) )
=> finite(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t13_finset_1) ).
fof(t100_zfmisc_1,axiom,
! [X1] : subset(X1,powerset(union(X1))),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t100_zfmisc_1) ).
fof(t92_zfmisc_1,axiom,
! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t92_zfmisc_1) ).
fof(t24_finset_1,axiom,
! [X1] :
( finite(X1)
<=> finite(powerset(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t24_finset_1) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ( finite(X1)
& ! [X2] :
( in(X2,X1)
=> finite(X2) ) )
<=> finite(union(X1)) ),
inference(assume_negation,[status(cth)],[t25_finset_1]) ).
fof(c_0_7,negated_conjecture,
! [X5] :
( ( in(esk2_0,esk1_0)
| ~ finite(esk1_0)
| ~ finite(union(esk1_0)) )
& ( ~ finite(esk2_0)
| ~ finite(esk1_0)
| ~ finite(union(esk1_0)) )
& ( finite(esk1_0)
| finite(union(esk1_0)) )
& ( ~ in(X5,esk1_0)
| finite(X5)
| finite(union(esk1_0)) ) ),
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)],[c_0_6])])])])])])]) ).
fof(c_0_8,plain,
! [X3] :
( ( in(esk5_1(X3),X3)
| ~ finite(X3)
| finite(union(X3)) )
& ( ~ finite(esk5_1(X3))
| ~ finite(X3)
| finite(union(X3)) ) ),
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)],[l22_finset_1])])])])])]) ).
cnf(c_0_9,negated_conjecture,
( finite(union(esk1_0))
| finite(X1)
| ~ in(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( finite(union(X1))
| in(esk5_1(X1),X1)
| ~ finite(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( finite(union(esk1_0))
| finite(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X3,X4] :
( ~ subset(X3,X4)
| ~ finite(X4)
| finite(X3) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t13_finset_1])])])]) ).
fof(c_0_13,plain,
! [X2] : subset(X2,powerset(union(X2))),
inference(variable_rename,[status(thm)],[t100_zfmisc_1]) ).
fof(c_0_14,plain,
! [X3,X4] :
( ~ in(X3,X4)
| subset(X3,union(X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t92_zfmisc_1])]) ).
cnf(c_0_15,plain,
( finite(union(X1))
| ~ finite(X1)
| ~ finite(esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
( finite(esk5_1(esk1_0))
| finite(union(esk1_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_17,plain,
( finite(X1)
| ~ finite(X2)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
subset(X1,powerset(union(X1))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,plain,
! [X2,X2] :
( ( ~ finite(X2)
| finite(powerset(X2)) )
& ( ~ finite(powerset(X2))
| finite(X2) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t24_finset_1])])])]) ).
cnf(c_0_20,plain,
( subset(X1,union(X2))
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
( in(esk2_0,esk1_0)
| ~ finite(union(esk1_0))
| ~ finite(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
finite(union(esk1_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_11]) ).
cnf(c_0_23,negated_conjecture,
( ~ finite(union(esk1_0))
| ~ finite(esk1_0)
| ~ finite(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_24,plain,
( finite(X1)
| ~ finite(powerset(union(X1))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
( finite(powerset(X1))
| ~ finite(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( finite(X1)
| ~ finite(union(X2))
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_27,negated_conjecture,
( in(esk2_0,esk1_0)
| ~ finite(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_28,negated_conjecture,
( ~ finite(esk1_0)
| ~ finite(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_22])]) ).
cnf(c_0_29,plain,
( finite(X1)
| ~ finite(union(X1)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
~ finite(esk1_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_22])]),c_0_28]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_22]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU094+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n024.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 Jun 19 22:50:02 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.017 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 32
% 0.23/1.41 # Proof object clause steps : 19
% 0.23/1.41 # Proof object formula steps : 13
% 0.23/1.41 # Proof object conjectures : 13
% 0.23/1.41 # Proof object clause conjectures : 10
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 10
% 0.23/1.41 # Proof object initial formulas used : 6
% 0.23/1.41 # Proof object generating inferences : 7
% 0.23/1.41 # Proof object simplifying inferences : 10
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 60
% 0.23/1.41 # Removed by relevancy pruning/SinE : 28
% 0.23/1.41 # Initial clauses : 55
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 55
% 0.23/1.41 # Processed clauses : 87
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 10
% 0.23/1.41 # ...remaining for further processing : 77
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 1
% 0.23/1.41 # Backward-rewritten : 10
% 0.23/1.41 # Generated clauses : 80
% 0.23/1.41 # ...of the previous two non-trivial : 69
% 0.23/1.41 # Contextual simplify-reflections : 9
% 0.23/1.41 # Paramodulations : 80
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 66
% 0.23/1.41 # Positive orientable unit clauses : 15
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 6
% 0.23/1.41 # Non-unit-clauses : 45
% 0.23/1.41 # Current number of unprocessed clauses: 28
% 0.23/1.41 # ...number of literals in the above : 70
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 11
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 226
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 216
% 0.23/1.41 # Non-unit clause-clause subsumptions : 15
% 0.23/1.41 # Unit Clause-clause subsumption calls : 41
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 8
% 0.23/1.41 # BW rewrite match successes : 2
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 3630
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.015 s
% 0.23/1.41 # System time : 0.006 s
% 0.23/1.41 # Total time : 0.021 s
% 0.23/1.41 # Maximum resident set size: 3048 pages
%------------------------------------------------------------------------------