TSTP Solution File: SEU169+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU169+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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:17:25 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 9 unt; 0 def)
% Number of atoms : 74 ( 7 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 80 ( 29 ~; 28 |; 11 &)
% ( 5 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 10 sgn 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l3_subset_1,conjecture,
! [X1,X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( in(X3,X2)
=> in(X3,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l3_subset_1) ).
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_subset_1) ).
fof(fc1_subset_1,axiom,
! [X1] : ~ empty(powerset(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc1_subset_1) ).
fof(d1_zfmisc_1,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_zfmisc_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_tarski) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] :
( element(X2,powerset(X1))
=> ! [X3] :
( in(X3,X2)
=> in(X3,X1) ) ),
inference(assume_negation,[status(cth)],[l3_subset_1]) ).
fof(c_0_6,plain,
! [X3,X4,X4,X3,X4,X4] :
( ( ~ element(X4,X3)
| in(X4,X3)
| empty(X3) )
& ( ~ in(X4,X3)
| element(X4,X3)
| empty(X3) )
& ( ~ element(X4,X3)
| empty(X4)
| ~ empty(X3) )
& ( ~ empty(X4)
| element(X4,X3)
| ~ empty(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[d2_subset_1])])])])])]) ).
fof(c_0_7,negated_conjecture,
( element(esk2_0,powerset(esk1_0))
& in(esk3_0,esk2_0)
& ~ in(esk3_0,esk1_0) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
fof(c_0_8,plain,
! [X2] : ~ empty(powerset(X2)),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[fc1_subset_1])]) ).
fof(c_0_9,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(esk8_2(X4,X5),X5)
| ~ subset(esk8_2(X4,X5),X4)
| X5 = powerset(X4) )
& ( in(esk8_2(X4,X5),X5)
| subset(esk8_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])])])])])])]) ).
cnf(c_0_10,plain,
( empty(X1)
| in(X2,X1)
| ~ element(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
element(esk2_0,powerset(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
~ empty(powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( subset(X3,X2)
| X1 != powerset(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
in(esk2_0,powerset(esk1_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
fof(c_0_15,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk4_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk4_2(X4,X5),X5)
| subset(X4,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)],[d3_tarski])])])])])])]) ).
cnf(c_0_16,negated_conjecture,
( subset(esk2_0,X1)
| powerset(esk1_0) != powerset(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,negated_conjecture,
subset(esk2_0,esk1_0),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
~ in(esk3_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,negated_conjecture,
( in(X1,esk1_0)
| ~ in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
in(esk3_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU169+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n027.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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 19 04:36:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.021 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 23
% 0.21/1.40 # Proof object clause steps : 12
% 0.21/1.40 # Proof object formula steps : 11
% 0.21/1.40 # Proof object conjectures : 11
% 0.21/1.40 # Proof object clause conjectures : 8
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 7
% 0.21/1.40 # Proof object initial formulas used : 5
% 0.21/1.40 # Proof object generating inferences : 5
% 0.21/1.40 # Proof object simplifying inferences : 3
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 105
% 0.21/1.40 # Removed by relevancy pruning/SinE : 42
% 0.21/1.40 # Initial clauses : 107
% 0.21/1.40 # Removed in clause preprocessing : 1
% 0.21/1.40 # Initial clauses in saturation : 106
% 0.21/1.40 # Processed clauses : 143
% 0.21/1.40 # ...of these trivial : 7
% 0.21/1.40 # ...subsumed : 13
% 0.21/1.40 # ...remaining for further processing : 123
% 0.21/1.40 # Other redundant clauses eliminated : 32
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 0
% 0.21/1.40 # Backward-rewritten : 18
% 0.21/1.40 # Generated clauses : 658
% 0.21/1.40 # ...of the previous two non-trivial : 498
% 0.21/1.40 # Contextual simplify-reflections : 1
% 0.21/1.40 # Paramodulations : 603
% 0.21/1.40 # Factorizations : 14
% 0.21/1.40 # Equation resolutions : 41
% 0.21/1.40 # Current number of processed clauses : 102
% 0.21/1.40 # Positive orientable unit clauses : 22
% 0.21/1.40 # Positive unorientable unit clauses: 2
% 0.21/1.40 # Negative unit clauses : 13
% 0.21/1.40 # Non-unit-clauses : 65
% 0.21/1.40 # Current number of unprocessed clauses: 365
% 0.21/1.40 # ...number of literals in the above : 990
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 19
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 526
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 403
% 0.21/1.40 # Non-unit clause-clause subsumptions : 11
% 0.21/1.40 # Unit Clause-clause subsumption calls : 349
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 35
% 0.21/1.40 # BW rewrite match successes : 13
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 10900
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.034 s
% 0.21/1.40 # System time : 0.000 s
% 0.21/1.40 # Total time : 0.034 s
% 0.21/1.40 # Maximum resident set size: 3464 pages
%------------------------------------------------------------------------------