%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU354+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n009.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:19:18 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 8 unt; 0 def)
% Number of atoms : 38 ( 15 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 37 ( 16 ~; 12 |; 3 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 15 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t5_tex_2,conjecture,
! [X1,X2] :
( element(X2,powerset(X1))
=> ( proper_element(X2,powerset(X1))
<=> X2 != X1 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t5_tex_2) ).
fof(d2_tex_2,axiom,
! [X1,X2] :
( element(X2,X1)
=> ( proper_element(X2,X1)
<=> X2 != union(X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_tex_2) ).
fof(t99_zfmisc_1,axiom,
! [X1] : union(powerset(X1)) = X1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t99_zfmisc_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( element(X2,powerset(X1))
=> ( proper_element(X2,powerset(X1))
<=> X2 != X1 ) ),
inference(assume_negation,[status(cth)],[t5_tex_2]) ).
fof(c_0_4,plain,
! [X3,X4] :
( ( ~ proper_element(X4,X3)
| X4 != union(X3)
| ~ element(X4,X3) )
& ( X4 = union(X3)
| proper_element(X4,X3)
| ~ element(X4,X3) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_tex_2])])]) ).
fof(c_0_5,negated_conjecture,
( element(esk2_0,powerset(esk1_0))
& ( ~ proper_element(esk2_0,powerset(esk1_0))
| esk2_0 = esk1_0 )
& ( proper_element(esk2_0,powerset(esk1_0))
| esk2_0 != esk1_0 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_6,plain,
! [X2] : union(powerset(X2)) = X2,
inference(variable_rename,[status(thm)],[t99_zfmisc_1]) ).
cnf(c_0_7,plain,
( proper_element(X1,X2)
| X1 = union(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
element(esk2_0,powerset(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
union(powerset(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( esk2_0 = esk1_0
| ~ proper_element(esk2_0,powerset(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
( proper_element(esk2_0,powerset(esk1_0))
| esk2_0 != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
esk1_0 = esk2_0,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10]) ).
cnf(c_0_13,plain,
( ~ element(X1,X2)
| X1 != union(X2)
| ~ proper_element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,negated_conjecture,
proper_element(esk2_0,powerset(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_12])]) ).
cnf(c_0_15,negated_conjecture,
element(esk2_0,powerset(esk2_0)),
inference(rw,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_9])]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU354+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n009.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 : Sat Jun 18 21:22:08 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.015 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 : 17
% 0.24/1.42 # Proof object clause steps : 10
% 0.24/1.42 # Proof object formula steps : 7
% 0.24/1.42 # Proof object conjectures : 10
% 0.24/1.42 # Proof object clause conjectures : 7
% 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 : 3
% 0.24/1.42 # Proof object generating inferences : 2
% 0.24/1.42 # Proof object simplifying inferences : 10
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 43
% 0.24/1.42 # Removed by relevancy pruning/SinE : 38
% 0.24/1.42 # Initial clauses : 9
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 9
% 0.24/1.42 # Processed clauses : 13
% 0.24/1.42 # ...of these trivial : 0
% 0.24/1.42 # ...subsumed : 0
% 0.24/1.42 # ...remaining for further processing : 12
% 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 : 7
% 0.24/1.42 # ...of the previous two non-trivial : 7
% 0.24/1.42 # Contextual simplify-reflections : 1
% 0.24/1.42 # Paramodulations : 7
% 0.24/1.42 # Factorizations : 0
% 0.24/1.42 # Equation resolutions : 0
% 0.24/1.42 # Current number of processed clauses : 9
% 0.24/1.42 # Positive orientable unit clauses : 6
% 0.24/1.42 # Positive unorientable unit clauses: 0
% 0.24/1.42 # Negative unit clauses : 1
% 0.24/1.42 # Non-unit-clauses : 2
% 0.24/1.42 # Current number of unprocessed clauses: 2
% 0.24/1.42 # ...number of literals in the above : 4
% 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) : 1
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 1
% 0.24/1.42 # Non-unit clause-clause subsumptions : 1
% 0.24/1.42 # Unit Clause-clause subsumption calls : 1
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 1
% 0.24/1.42 # BW rewrite match successes : 1
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 871
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.012 s
% 0.24/1.42 # System time : 0.003 s
% 0.24/1.42 # Total time : 0.016 s
% 0.24/1.42 # Maximum resident set size: 2716 pages
%------------------------------------------------------------------------------