%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU294+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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:18:43 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 4 unt; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 31 ( 12 ~; 9 |; 5 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 20 ( 2 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(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(t13_finset_1,conjecture,
! [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(c_0_3,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_4,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_5,negated_conjecture,
~ ! [X1,X2] :
( ( subset(X1,X2)
& finite(X2) )
=> finite(X1) ),
inference(assume_negation,[status(cth)],[t13_finset_1]) ).
cnf(c_0_6,plain,
( finite(X1)
| ~ element(X1,powerset(X2))
| ~ finite(X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,negated_conjecture,
( subset(esk1_0,esk2_0)
& finite(esk2_0)
& ~ finite(esk1_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_9,plain,
( finite(X1)
| ~ subset(X1,X2)
| ~ finite(X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,negated_conjecture,
finite(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
~ finite(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU294+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n017.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 : Mon Jun 20 11:59:14 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.036 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 14
% 0.25/1.43 # Proof object clause steps : 7
% 0.25/1.43 # Proof object formula steps : 7
% 0.25/1.43 # Proof object conjectures : 7
% 0.25/1.43 # Proof object clause conjectures : 4
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 5
% 0.25/1.43 # Proof object initial formulas used : 3
% 0.25/1.43 # Proof object generating inferences : 2
% 0.25/1.43 # Proof object simplifying inferences : 3
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 395
% 0.25/1.43 # Removed by relevancy pruning/SinE : 332
% 0.25/1.43 # Initial clauses : 244
% 0.25/1.43 # Removed in clause preprocessing : 2
% 0.25/1.43 # Initial clauses in saturation : 242
% 0.25/1.43 # Processed clauses : 253
% 0.25/1.43 # ...of these trivial : 1
% 0.25/1.43 # ...subsumed : 14
% 0.25/1.43 # ...remaining for further processing : 238
% 0.25/1.43 # Other redundant clauses eliminated : 39
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 0
% 0.25/1.43 # Backward-rewritten : 22
% 0.25/1.43 # Generated clauses : 1407
% 0.25/1.43 # ...of the previous two non-trivial : 1367
% 0.25/1.43 # Contextual simplify-reflections : 39
% 0.25/1.43 # Paramodulations : 1363
% 0.25/1.43 # Factorizations : 2
% 0.25/1.43 # Equation resolutions : 42
% 0.25/1.43 # Current number of processed clauses : 178
% 0.25/1.43 # Positive orientable unit clauses : 15
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 7
% 0.25/1.43 # Non-unit-clauses : 156
% 0.25/1.43 # Current number of unprocessed clauses: 1209
% 0.25/1.43 # ...number of literals in the above : 7979
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 22
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 13724
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 1405
% 0.25/1.43 # Non-unit clause-clause subsumptions : 53
% 0.25/1.43 # Unit Clause-clause subsumption calls : 620
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 3
% 0.25/1.43 # BW rewrite match successes : 3
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 47870
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.095 s
% 0.25/1.43 # System time : 0.004 s
% 0.25/1.43 # Total time : 0.099 s
% 0.25/1.43 # Maximum resident set size: 5340 pages
%------------------------------------------------------------------------------