TSTP Solution File: SEU173+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU173+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n028.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:27 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 4 unt; 0 def)
% Number of atoms : 80 ( 7 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 89 ( 33 ~; 33 |; 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 52 ( 10 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l71_subset_1,conjecture,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
=> in(X3,X2) )
=> element(X1,powerset(X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l71_subset_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_tarski) ).
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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_subset_1) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_boole) ).
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(c_0_5,negated_conjecture,
~ ! [X1,X2] :
( ! [X3] :
( in(X3,X1)
=> in(X3,X2) )
=> element(X1,powerset(X2)) ),
inference(assume_negation,[status(cth)],[l71_subset_1]) ).
fof(c_0_6,negated_conjecture,
! [X6] :
( ( ~ in(X6,esk4_0)
| in(X6,esk5_0) )
& ~ element(esk4_0,powerset(esk5_0)) ),
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)],[c_0_5])])])])])]) ).
fof(c_0_7,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk2_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk2_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_8,negated_conjecture,
( in(X1,esk5_0)
| ~ in(X1,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( subset(X1,X2)
| in(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,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_11,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
fof(c_0_12,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(esk1_2(X4,X5),X5)
| ~ subset(esk1_2(X4,X5),X4)
| X5 = powerset(X4) )
& ( in(esk1_2(X4,X5),X5)
| subset(esk1_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_13,plain,
( subset(X1,X2)
| ~ in(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
( subset(esk4_0,X1)
| in(esk2_2(esk4_0,X1),esk5_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,plain,
( empty(X1)
| element(X2,X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( in(X3,X1)
| X1 != powerset(X2)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
subset(esk4_0,esk5_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
~ element(esk4_0,powerset(esk5_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
inference(csr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( in(esk4_0,X1)
| X1 != powerset(esk5_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
~ in(esk4_0,powerset(esk5_0)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU173+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n028.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 16:23:15 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.015 s
% 0.21/1.40
% 0.21/1.40 # Failure: Out of unprocessed clauses!
% 0.21/1.40 # OLD status GaveUp
% 0.21/1.40 # Parsed axioms : 19
% 0.21/1.40 # Removed by relevancy pruning/SinE : 8
% 0.21/1.40 # Initial clauses : 17
% 0.21/1.40 # Removed in clause preprocessing : 0
% 0.21/1.40 # Initial clauses in saturation : 17
% 0.21/1.40 # Processed clauses : 153
% 0.21/1.40 # ...of these trivial : 0
% 0.21/1.40 # ...subsumed : 98
% 0.21/1.40 # ...remaining for further processing : 55
% 0.21/1.40 # Other redundant clauses eliminated : 0
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 1
% 0.21/1.40 # Backward-rewritten : 3
% 0.21/1.40 # Generated clauses : 184
% 0.21/1.40 # ...of the previous two non-trivial : 140
% 0.21/1.40 # Contextual simplify-reflections : 110
% 0.21/1.40 # Paramodulations : 184
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 0
% 0.21/1.40 # Current number of processed clauses : 51
% 0.21/1.40 # Positive orientable unit clauses : 4
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 4
% 0.21/1.40 # Non-unit-clauses : 43
% 0.21/1.40 # Current number of unprocessed clauses: 0
% 0.21/1.40 # ...number of literals in the above : 0
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 4
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 1670
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 1587
% 0.21/1.40 # Non-unit clause-clause subsumptions : 205
% 0.21/1.40 # Unit Clause-clause subsumption calls : 6
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 2
% 0.21/1.40 # BW rewrite match successes : 2
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 2591
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.019 s
% 0.21/1.40 # System time : 0.002 s
% 0.21/1.40 # Total time : 0.021 s
% 0.21/1.40 # Maximum resident set size: 2776 pages
% 0.21/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.21/1.40 # Preprocessing time : 0.015 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 : 24
% 0.21/1.40 # Proof object clause steps : 13
% 0.21/1.40 # Proof object formula steps : 11
% 0.21/1.40 # Proof object conjectures : 10
% 0.21/1.40 # Proof object clause conjectures : 7
% 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 : 2
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 19
% 0.21/1.40 # Removed by relevancy pruning/SinE : 0
% 0.21/1.40 # Initial clauses : 30
% 0.21/1.40 # Removed in clause preprocessing : 3
% 0.21/1.40 # Initial clauses in saturation : 27
% 0.21/1.40 # Processed clauses : 55
% 0.21/1.40 # ...of these trivial : 0
% 0.21/1.40 # ...subsumed : 7
% 0.21/1.40 # ...remaining for further processing : 48
% 0.21/1.40 # Other redundant clauses eliminated : 0
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 0
% 0.21/1.40 # Backward-rewritten : 4
% 0.21/1.40 # Generated clauses : 62
% 0.21/1.40 # ...of the previous two non-trivial : 49
% 0.21/1.40 # Contextual simplify-reflections : 3
% 0.21/1.40 # Paramodulations : 58
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 4
% 0.21/1.40 # Current number of processed clauses : 44
% 0.21/1.40 # Positive orientable unit clauses : 10
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 6
% 0.21/1.40 # Non-unit-clauses : 28
% 0.21/1.40 # Current number of unprocessed clauses: 18
% 0.21/1.40 # ...number of literals in the above : 52
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 4
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 68
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 59
% 0.21/1.40 # Non-unit clause-clause subsumptions : 6
% 0.21/1.40 # Unit Clause-clause subsumption calls : 24
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 5
% 0.21/1.40 # BW rewrite match successes : 3
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 1974
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.016 s
% 0.21/1.40 # System time : 0.002 s
% 0.21/1.40 # Total time : 0.018 s
% 0.21/1.40 # Maximum resident set size: 2780 pages
%------------------------------------------------------------------------------