%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET933+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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 00:55:34 EDT 2022
% Result : Theorem 0.22s 1.41s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 10 unt; 0 def)
% Number of atoms : 38 ( 7 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 37 ( 16 ~; 14 |; 4 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 29 ( 6 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t80_zfmisc_1,conjecture,
! [X1] : subset(singleton(X1),powerset(X1)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t80_zfmisc_1) ).
fof(d1_zfmisc_1,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_zfmisc_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',reflexivity_r1_tarski) ).
fof(l2_zfmisc_1,axiom,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l2_zfmisc_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] : subset(singleton(X1),powerset(X1)),
inference(assume_negation,[status(cth)],[t80_zfmisc_1]) ).
fof(c_0_5,plain,
! [X4,X5,X6,X6,X4,X5] :
( ( ~ in(X6,X5)
| subset(X6,X4)
| X5 != powerset(X4) )
& ( ~ subset(X6,X4)
| in(X6,X5)
| X5 != powerset(X4) )
& ( ~ in(esk2_2(X4,X5),X5)
| ~ subset(esk2_2(X4,X5),X4)
| X5 = powerset(X4) )
& ( in(esk2_2(X4,X5),X5)
| subset(esk2_2(X4,X5),X4)
| X5 = powerset(X4) ) ),
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)],[d1_zfmisc_1])])])])])])]) ).
fof(c_0_6,plain,
! [X3] : subset(X3,X3),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(c_0_7,negated_conjecture,
~ subset(singleton(esk1_0),powerset(esk1_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_8,plain,
! [X3,X4,X3,X4] :
( ( ~ subset(singleton(X3),X4)
| in(X3,X4) )
& ( ~ in(X3,X4)
| subset(singleton(X3),X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l2_zfmisc_1])])])]) ).
cnf(c_0_9,plain,
( in(X3,X1)
| X1 != powerset(X2)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
~ subset(singleton(esk1_0),powerset(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( in(X1,X2)
| X2 != powerset(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
~ in(esk1_0,powerset(esk1_0)),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
in(X1,powerset(X1)),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET933+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.12 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % 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 : Sat Jul 9 16:59:56 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.22/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41 # Preprocessing time : 0.014 s
% 0.22/1.41
% 0.22/1.41 # Proof found!
% 0.22/1.41 # SZS status Theorem
% 0.22/1.41 # SZS output start CNFRefutation
% See solution above
% 0.22/1.41 # Proof object total steps : 17
% 0.22/1.41 # Proof object clause steps : 8
% 0.22/1.41 # Proof object formula steps : 9
% 0.22/1.41 # Proof object conjectures : 6
% 0.22/1.41 # Proof object clause conjectures : 3
% 0.22/1.41 # Proof object formula conjectures : 3
% 0.22/1.41 # Proof object initial clauses used : 4
% 0.22/1.41 # Proof object initial formulas used : 4
% 0.22/1.41 # Proof object generating inferences : 3
% 0.22/1.41 # Proof object simplifying inferences : 2
% 0.22/1.41 # Training examples: 0 positive, 0 negative
% 0.22/1.41 # Parsed axioms : 7
% 0.22/1.41 # Removed by relevancy pruning/SinE : 2
% 0.22/1.41 # Initial clauses : 9
% 0.22/1.41 # Removed in clause preprocessing : 0
% 0.22/1.41 # Initial clauses in saturation : 9
% 0.22/1.41 # Processed clauses : 14
% 0.22/1.41 # ...of these trivial : 0
% 0.22/1.41 # ...subsumed : 0
% 0.22/1.41 # ...remaining for further processing : 14
% 0.22/1.41 # Other redundant clauses eliminated : 0
% 0.22/1.41 # Clauses deleted for lack of memory : 0
% 0.22/1.41 # Backward-subsumed : 0
% 0.22/1.41 # Backward-rewritten : 1
% 0.22/1.41 # Generated clauses : 12
% 0.22/1.41 # ...of the previous two non-trivial : 8
% 0.22/1.41 # Contextual simplify-reflections : 0
% 0.22/1.41 # Paramodulations : 11
% 0.22/1.41 # Factorizations : 0
% 0.22/1.41 # Equation resolutions : 1
% 0.22/1.41 # Current number of processed clauses : 13
% 0.22/1.41 # Positive orientable unit clauses : 3
% 0.22/1.41 # Positive unorientable unit clauses: 0
% 0.22/1.41 # Negative unit clauses : 2
% 0.22/1.41 # Non-unit-clauses : 8
% 0.22/1.41 # Current number of unprocessed clauses: 3
% 0.22/1.41 # ...number of literals in the above : 9
% 0.22/1.41 # Current number of archived formulas : 0
% 0.22/1.41 # Current number of archived clauses : 1
% 0.22/1.41 # Clause-clause subsumption calls (NU) : 2
% 0.22/1.41 # Rec. Clause-clause subsumption calls : 2
% 0.22/1.41 # Non-unit clause-clause subsumptions : 0
% 0.22/1.41 # Unit Clause-clause subsumption calls : 1
% 0.22/1.41 # Rewrite failures with RHS unbound : 0
% 0.22/1.41 # BW rewrite match attempts : 2
% 0.22/1.41 # BW rewrite match successes : 1
% 0.22/1.41 # Condensation attempts : 0
% 0.22/1.41 # Condensation successes : 0
% 0.22/1.41 # Termbank termtop insertions : 619
% 0.22/1.41
% 0.22/1.41 # -------------------------------------------------
% 0.22/1.41 # User time : 0.010 s
% 0.22/1.41 # System time : 0.004 s
% 0.22/1.41 # Total time : 0.014 s
% 0.22/1.41 # Maximum resident set size: 2768 pages
%------------------------------------------------------------------------------