TSTP Solution File: SEU117+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU117+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:53 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 7 unt; 0 def)
% Number of atoms : 82 ( 11 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 93 ( 35 ~; 37 |; 14 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 8 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d5_finsub_1) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_subset) ).
fof(t32_finsub_1,conjecture,
! [X1,X2] :
( element(X2,finite_subsets(X1))
=> element(X2,powerset(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t32_finsub_1) ).
fof(dt_k5_finsub_1,axiom,
! [X1] : preboolean(finite_subsets(X1)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k5_finsub_1) ).
fof(fc2_finsub_1,axiom,
! [X1] :
( ~ empty(finite_subsets(X1))
& cup_closed(finite_subsets(X1))
& diff_closed(finite_subsets(X1))
& preboolean(finite_subsets(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc2_finsub_1) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_subset) ).
fof(c_0_6,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(esk13_2(X4,X5),X5)
| ~ subset(esk13_2(X4,X5),X4)
| ~ finite(esk13_2(X4,X5))
| X5 = finite_subsets(X4)
| ~ preboolean(X5) )
& ( subset(esk13_2(X4,X5),X4)
| in(esk13_2(X4,X5),X5)
| X5 = finite_subsets(X4)
| ~ preboolean(X5) )
& ( finite(esk13_2(X4,X5))
| in(esk13_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_7,plain,
! [X3,X4] :
( ~ element(X3,X4)
| empty(X4)
| in(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X2] :
( element(X2,finite_subsets(X1))
=> element(X2,powerset(X1)) ),
inference(assume_negation,[status(cth)],[t32_finsub_1]) ).
cnf(c_0_9,plain,
( subset(X3,X2)
| ~ preboolean(X1)
| X1 != finite_subsets(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,negated_conjecture,
( element(esk12_0,finite_subsets(esk11_0))
& ~ element(esk12_0,powerset(esk11_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_12,plain,
! [X2] : preboolean(finite_subsets(X2)),
inference(variable_rename,[status(thm)],[dt_k5_finsub_1]) ).
fof(c_0_13,plain,
! [X2,X2,X2,X2] :
( ~ empty(finite_subsets(X2))
& cup_closed(finite_subsets(X2))
& diff_closed(finite_subsets(X2))
& preboolean(finite_subsets(X2)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[fc2_finsub_1])])])]) ).
fof(c_0_14,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])])])]) ).
cnf(c_0_15,plain,
( subset(X1,X2)
| empty(X3)
| X3 != finite_subsets(X2)
| ~ element(X1,X3)
| ~ preboolean(X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
element(esk12_0,finite_subsets(esk11_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
preboolean(finite_subsets(X1)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
~ empty(finite_subsets(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
( subset(esk12_0,X1)
| finite_subsets(esk11_0) != finite_subsets(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),c_0_18]) ).
cnf(c_0_21,negated_conjecture,
~ element(esk12_0,powerset(esk11_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,negated_conjecture,
( element(esk12_0,powerset(X1))
| finite_subsets(esk11_0) != finite_subsets(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_21,c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU117+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 05:02:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42 # Preprocessing time : 0.016 s
% 0.24/1.42
% 0.24/1.42 # Failure: Out of unprocessed clauses!
% 0.24/1.42 # OLD status GaveUp
% 0.24/1.42 # Parsed axioms : 32
% 0.24/1.42 # Removed by relevancy pruning/SinE : 13
% 0.24/1.42 # Initial clauses : 34
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 34
% 0.24/1.42 # Processed clauses : 45
% 0.24/1.42 # ...of these trivial : 1
% 0.24/1.42 # ...subsumed : 3
% 0.24/1.42 # ...remaining for further processing : 41
% 0.24/1.42 # Other redundant clauses eliminated : 0
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 0
% 0.24/1.42 # Backward-rewritten : 3
% 0.24/1.42 # Generated clauses : 19
% 0.24/1.42 # ...of the previous two non-trivial : 17
% 0.24/1.42 # Contextual simplify-reflections : 2
% 0.24/1.42 # Paramodulations : 19
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 38
% 0.24/1.42 # Positive orientable unit clauses : 15
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 5
% 0.24/1.42 # Non-unit-clauses : 18
% 0.24/1.42 # Current number of unprocessed clauses: 0
% 0.24/1.42 # ...number of literals in the above : 0
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 3
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 33
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 32
% 0.24/1.42 # Non-unit clause-clause subsumptions : 4
% 0.24/1.42 # Unit Clause-clause subsumption calls : 15
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 2
% 0.24/1.42 # BW rewrite match successes : 2
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 1701
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.016 s
% 0.24/1.42 # System time : 0.002 s
% 0.24/1.42 # Total time : 0.018 s
% 0.24/1.42 # Maximum resident set size: 2984 pages
% 0.24/1.42 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.24/1.42 # Preprocessing time : 0.017 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 24
% 0.24/1.42 # Proof object clause steps : 11
% 0.24/1.42 # Proof object formula steps : 13
% 0.24/1.42 # Proof object conjectures : 8
% 0.24/1.42 # Proof object clause conjectures : 5
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 7
% 0.24/1.42 # Proof object initial formulas used : 6
% 0.24/1.42 # Proof object generating inferences : 4
% 0.24/1.42 # Proof object simplifying inferences : 3
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 32
% 0.24/1.42 # Removed by relevancy pruning/SinE : 0
% 0.24/1.42 # Initial clauses : 66
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 66
% 0.24/1.42 # Processed clauses : 196
% 0.24/1.42 # ...of these trivial : 2
% 0.24/1.42 # ...subsumed : 33
% 0.24/1.42 # ...remaining for further processing : 161
% 0.24/1.42 # Other redundant clauses eliminated : 0
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 3
% 0.24/1.42 # Backward-rewritten : 14
% 0.24/1.42 # Generated clauses : 225
% 0.24/1.42 # ...of the previous two non-trivial : 196
% 0.24/1.42 # Contextual simplify-reflections : 15
% 0.24/1.42 # Paramodulations : 207
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 18
% 0.24/1.42 # Current number of processed clauses : 144
% 0.24/1.42 # Positive orientable unit clauses : 33
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 8
% 0.24/1.42 # Non-unit-clauses : 103
% 0.24/1.42 # Current number of unprocessed clauses: 59
% 0.24/1.42 # ...number of literals in the above : 214
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 17
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 1768
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 749
% 0.24/1.42 # Non-unit clause-clause subsumptions : 44
% 0.24/1.42 # Unit Clause-clause subsumption calls : 291
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 13
% 0.24/1.42 # BW rewrite match successes : 4
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 5574
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.024 s
% 0.24/1.42 # System time : 0.002 s
% 0.24/1.42 # Total time : 0.026 s
% 0.24/1.42 # Maximum resident set size: 3236 pages
% 0.24/23.43 eprover: CPU time limit exceeded, terminating
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49 eprover: No such file or directory
% 0.24/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.50 eprover: No such file or directory
% 0.24/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.50 eprover: No such file or directory
% 0.24/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.51 eprover: No such file or directory
% 0.24/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.51 eprover: No such file or directory
% 0.24/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.52 eprover: No such file or directory
%------------------------------------------------------------------------------