TSTP Solution File: SEU115+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU115+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 13 unt; 0 def)
% Number of atoms : 31 ( 14 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 20 ( 11 ~; 6 |; 0 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 10 ( 0 sgn 6 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t28_finsub_1,conjecture,
finite_subsets(empty_set) = singleton(empty_set),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t28_finsub_1) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t6_boole) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rc1_xboole_0) ).
fof(t1_zfmisc_1,axiom,
powerset(empty_set) = singleton(empty_set),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t1_zfmisc_1) ).
fof(t27_finsub_1,axiom,
! [X1] :
( finite(X1)
=> finite_subsets(X1) = powerset(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t27_finsub_1) ).
fof(cc1_finset_1,axiom,
! [X1] :
( empty(X1)
=> finite(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',cc1_finset_1) ).
fof(c_0_6,negated_conjecture,
finite_subsets(empty_set) != singleton(empty_set),
inference(assume_negation,[status(cth)],[t28_finsub_1]) ).
fof(c_0_7,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_8,plain,
empty(esk4_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
fof(c_0_9,negated_conjecture,
finite_subsets(empty_set) != singleton(empty_set),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
empty(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
finite_subsets(empty_set) != singleton(empty_set),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
powerset(empty_set) = singleton(empty_set),
inference(split_conjunct,[status(thm)],[t1_zfmisc_1]) ).
cnf(c_0_14,plain,
empty_set = esk4_0,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_15,plain,
! [X2] :
( ~ finite(X2)
| finite_subsets(X2) = powerset(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t27_finsub_1])]) ).
cnf(c_0_16,negated_conjecture,
finite_subsets(esk4_0) != powerset(esk4_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_14]) ).
cnf(c_0_17,plain,
( finite_subsets(X1) = powerset(X1)
| ~ finite(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X2] :
( ~ empty(X2)
| finite(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_finset_1])]) ).
cnf(c_0_19,negated_conjecture,
~ finite(esk4_0),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( finite(X1)
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU115+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n007.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 08:42:14 EDT 2022
% 0.13/0.35 % 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 # 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 : 22
% 0.24/1.42 # Proof object clause steps : 10
% 0.24/1.42 # Proof object formula steps : 12
% 0.24/1.42 # Proof object conjectures : 7
% 0.24/1.42 # Proof object clause conjectures : 4
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 6
% 0.24/1.42 # Proof object initial formulas used : 6
% 0.24/1.42 # Proof object generating inferences : 3
% 0.24/1.42 # Proof object simplifying inferences : 5
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 35
% 0.24/1.42 # Removed by relevancy pruning/SinE : 10
% 0.24/1.42 # Initial clauses : 40
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 40
% 0.24/1.42 # Processed clauses : 44
% 0.24/1.42 # ...of these trivial : 1
% 0.24/1.42 # ...subsumed : 3
% 0.24/1.42 # ...remaining for further processing : 40
% 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 : 4
% 0.24/1.42 # Generated clauses : 23
% 0.24/1.42 # ...of the previous two non-trivial : 21
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 23
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 36
% 0.24/1.42 # Positive orientable unit clauses : 13
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 7
% 0.24/1.42 # Non-unit-clauses : 16
% 0.24/1.42 # Current number of unprocessed clauses: 14
% 0.24/1.42 # ...number of literals in the above : 30
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 4
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 6
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 6
% 0.24/1.42 # Non-unit clause-clause subsumptions : 0
% 0.24/1.42 # Unit Clause-clause subsumption calls : 24
% 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 : 1795
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.015 s
% 0.24/1.42 # System time : 0.003 s
% 0.24/1.42 # Total time : 0.018 s
% 0.24/1.42 # Maximum resident set size: 3000 pages
%------------------------------------------------------------------------------