TSTP Solution File: SEU118+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU118+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n004.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:53 EDT 2022
% Result : Theorem 0.23s 1.40s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 8 unt; 0 def)
% Number of atoms : 88 ( 12 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 101 ( 40 ~; 41 |; 9 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 43 ( 4 sgn 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t34_finsub_1,conjecture,
! [X1,X2] :
( element(X2,powerset(X1))
=> ( finite(X1)
=> element(X2,finite_subsets(X1)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t34_finsub_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.mepo_128.in',d5_finsub_1) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_subset) ).
fof(cc2_finset_1,axiom,
! [X1] :
( finite(X1)
=> ! [X2] :
( element(X2,powerset(X1))
=> finite(X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',cc2_finset_1) ).
fof(dt_k5_finsub_1,axiom,
! [X1] : preboolean(finite_subsets(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k5_finsub_1) ).
fof(t1_subset,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t1_subset) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] :
( element(X2,powerset(X1))
=> ( finite(X1)
=> element(X2,finite_subsets(X1)) ) ),
inference(assume_negation,[status(cth)],[t34_finsub_1]) ).
fof(c_0_7,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(esk8_2(X4,X5),X5)
| ~ subset(esk8_2(X4,X5),X4)
| ~ finite(esk8_2(X4,X5))
| X5 = finite_subsets(X4)
| ~ preboolean(X5) )
& ( subset(esk8_2(X4,X5),X4)
| in(esk8_2(X4,X5),X5)
| X5 = finite_subsets(X4)
| ~ preboolean(X5) )
& ( finite(esk8_2(X4,X5))
| in(esk8_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])])])])])])]) ).
fof(c_0_8,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_9,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_10,negated_conjecture,
( element(esk2_0,powerset(esk1_0))
& finite(esk1_0)
& ~ element(esk2_0,finite_subsets(esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_11,plain,
( in(X3,X1)
| ~ preboolean(X1)
| X1 != finite_subsets(X2)
| ~ finite(X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( finite(X1)
| ~ element(X1,powerset(X2))
| ~ finite(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
element(esk2_0,powerset(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
finite(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( in(X1,X2)
| X2 != finite_subsets(X3)
| ~ element(X1,powerset(X3))
| ~ preboolean(X2)
| ~ finite(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
finite(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
fof(c_0_18,plain,
! [X2] : preboolean(finite_subsets(X2)),
inference(variable_rename,[status(thm)],[dt_k5_finsub_1]) ).
fof(c_0_19,plain,
! [X3,X4] :
( ~ in(X3,X4)
| element(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).
cnf(c_0_20,negated_conjecture,
( in(esk2_0,X1)
| X1 != finite_subsets(esk1_0)
| ~ preboolean(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_14]),c_0_17])]) ).
cnf(c_0_21,plain,
preboolean(finite_subsets(X1)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( in(esk2_0,finite_subsets(X1))
| finite_subsets(X1) != finite_subsets(esk1_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( element(esk2_0,finite_subsets(X1))
| finite_subsets(X1) != finite_subsets(esk1_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
~ element(esk2_0,finite_subsets(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_24]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU118+1 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n004.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 Jun 18 22:21:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.40 # Preprocessing time : 0.017 s
% 0.23/1.40
% 0.23/1.40 # Proof found!
% 0.23/1.40 # SZS status Theorem
% 0.23/1.40 # SZS output start CNFRefutation
% See solution above
% 0.23/1.40 # Proof object total steps : 27
% 0.23/1.40 # Proof object clause steps : 14
% 0.23/1.40 # Proof object formula steps : 13
% 0.23/1.40 # Proof object conjectures : 11
% 0.23/1.40 # Proof object clause conjectures : 8
% 0.23/1.40 # Proof object formula conjectures : 3
% 0.23/1.40 # Proof object initial clauses used : 8
% 0.23/1.40 # Proof object initial formulas used : 6
% 0.23/1.40 # Proof object generating inferences : 6
% 0.23/1.40 # Proof object simplifying inferences : 5
% 0.23/1.40 # Training examples: 0 positive, 0 negative
% 0.23/1.40 # Parsed axioms : 33
% 0.23/1.40 # Removed by relevancy pruning/SinE : 4
% 0.23/1.40 # Initial clauses : 51
% 0.23/1.40 # Removed in clause preprocessing : 0
% 0.23/1.40 # Initial clauses in saturation : 51
% 0.23/1.40 # Processed clauses : 130
% 0.23/1.40 # ...of these trivial : 1
% 0.23/1.40 # ...subsumed : 15
% 0.23/1.40 # ...remaining for further processing : 114
% 0.23/1.40 # Other redundant clauses eliminated : 0
% 0.23/1.40 # Clauses deleted for lack of memory : 0
% 0.23/1.40 # Backward-subsumed : 3
% 0.23/1.40 # Backward-rewritten : 4
% 0.23/1.40 # Generated clauses : 168
% 0.23/1.40 # ...of the previous two non-trivial : 142
% 0.23/1.40 # Contextual simplify-reflections : 9
% 0.23/1.40 # Paramodulations : 163
% 0.23/1.40 # Factorizations : 0
% 0.23/1.40 # Equation resolutions : 5
% 0.23/1.40 # Current number of processed clauses : 107
% 0.23/1.40 # Positive orientable unit clauses : 18
% 0.23/1.40 # Positive unorientable unit clauses: 0
% 0.23/1.40 # Negative unit clauses : 5
% 0.23/1.40 # Non-unit-clauses : 84
% 0.23/1.40 # Current number of unprocessed clauses: 52
% 0.23/1.40 # ...number of literals in the above : 213
% 0.23/1.40 # Current number of archived formulas : 0
% 0.23/1.40 # Current number of archived clauses : 7
% 0.23/1.40 # Clause-clause subsumption calls (NU) : 666
% 0.23/1.40 # Rec. Clause-clause subsumption calls : 330
% 0.23/1.40 # Non-unit clause-clause subsumptions : 24
% 0.23/1.40 # Unit Clause-clause subsumption calls : 23
% 0.23/1.40 # Rewrite failures with RHS unbound : 0
% 0.23/1.40 # BW rewrite match attempts : 10
% 0.23/1.40 # BW rewrite match successes : 3
% 0.23/1.40 # Condensation attempts : 0
% 0.23/1.40 # Condensation successes : 0
% 0.23/1.40 # Termbank termtop insertions : 4857
% 0.23/1.40
% 0.23/1.40 # -------------------------------------------------
% 0.23/1.40 # User time : 0.022 s
% 0.23/1.40 # System time : 0.003 s
% 0.23/1.40 # Total time : 0.025 s
% 0.23/1.40 # Maximum resident set size: 3296 pages
% 0.23/23.40 eprover: CPU time limit exceeded, terminating
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
%------------------------------------------------------------------------------