TSTP Solution File: SEU186+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU186+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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:37 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 13 unt; 0 def)
% Number of atoms : 69 ( 17 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 68 ( 31 ~; 23 |; 7 &)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 46 ( 3 sgn 29 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t56_relat_1,conjecture,
! [X1] :
( relation(X1)
=> ( ! [X2,X3] : ~ in(ordered_pair(X2,X3),X1)
=> X1 = empty_set ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t56_relat_1) ).
fof(d1_relat_1,axiom,
! [X1] :
( relation(X1)
<=> ! [X2] :
~ ( in(X2,X1)
& ! [X3,X4] : X2 != ordered_pair(X3,X4) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_relat_1) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',existence_m1_subset_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(t8_boole,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t8_boole) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( ! [X2,X3] : ~ in(ordered_pair(X2,X3),X1)
=> X1 = empty_set ) ),
inference(assume_negation,[status(cth)],[t56_relat_1]) ).
fof(c_0_8,negated_conjecture,
! [X5,X6] :
( relation(esk1_0)
& ~ in(ordered_pair(X5,X6),esk1_0)
& esk1_0 != empty_set ),
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)],[inference(fof_simplification,[status(thm)],[c_0_7])])])])])])]) ).
fof(c_0_9,plain,
! [X5,X6,X5,X10,X11] :
( ( ~ relation(X5)
| ~ in(X6,X5)
| X6 = ordered_pair(esk5_2(X5,X6),esk6_2(X5,X6)) )
& ( in(esk7_1(X5),X5)
| relation(X5) )
& ( esk7_1(X5) != ordered_pair(X10,X11)
| relation(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)],[d1_relat_1])])])])])])]) ).
fof(c_0_10,plain,
! [X3,X4] :
( ~ element(X3,X4)
| empty(X4)
| in(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
fof(c_0_11,plain,
! [X3] : element(esk17_1(X3),X3),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
cnf(c_0_12,negated_conjecture,
~ in(ordered_pair(X1,X2),esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( X1 = ordered_pair(esk5_2(X2,X1),esk6_2(X2,X1))
| ~ in(X1,X2)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
element(esk17_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_17,plain,
empty(esk11_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
fof(c_0_18,plain,
! [X3,X4] :
( ~ empty(X3)
| X3 = X4
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_boole])]) ).
cnf(c_0_19,negated_conjecture,
( ~ relation(X1)
| ~ in(X2,esk1_0)
| ~ in(X2,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_20,plain,
( empty(X1)
| in(esk17_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
empty(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( empty(esk1_0)
| ~ relation(X1)
| ~ in(esk17_1(esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,negated_conjecture,
esk1_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_27,plain,
empty_set = esk11_0,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
( X1 = esk11_0
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
empty(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_20]),c_0_25])]) ).
cnf(c_0_30,negated_conjecture,
esk1_0 != esk11_0,
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU186+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n020.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 : Mon Jun 20 03:25:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.021 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 32
% 0.22/1.40 # Proof object clause steps : 17
% 0.22/1.40 # Proof object formula steps : 15
% 0.22/1.40 # Proof object conjectures : 11
% 0.22/1.40 # Proof object clause conjectures : 8
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 9
% 0.22/1.40 # Proof object initial formulas used : 7
% 0.22/1.40 # Proof object generating inferences : 7
% 0.22/1.40 # Proof object simplifying inferences : 4
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 164
% 0.22/1.40 # Removed by relevancy pruning/SinE : 95
% 0.22/1.40 # Initial clauses : 115
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 115
% 0.22/1.40 # Processed clauses : 778
% 0.22/1.40 # ...of these trivial : 26
% 0.22/1.40 # ...subsumed : 420
% 0.22/1.40 # ...remaining for further processing : 332
% 0.22/1.40 # Other redundant clauses eliminated : 70
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 1
% 0.22/1.40 # Backward-rewritten : 34
% 0.22/1.40 # Generated clauses : 3308
% 0.22/1.40 # ...of the previous two non-trivial : 2599
% 0.22/1.40 # Contextual simplify-reflections : 49
% 0.22/1.40 # Paramodulations : 3191
% 0.22/1.40 # Factorizations : 10
% 0.22/1.40 # Equation resolutions : 103
% 0.22/1.40 # Current number of processed clauses : 290
% 0.22/1.40 # Positive orientable unit clauses : 52
% 0.22/1.40 # Positive unorientable unit clauses: 1
% 0.22/1.40 # Negative unit clauses : 21
% 0.22/1.40 # Non-unit-clauses : 216
% 0.22/1.40 # Current number of unprocessed clauses: 1781
% 0.22/1.40 # ...number of literals in the above : 5302
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 39
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 14792
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 12360
% 0.22/1.40 # Non-unit clause-clause subsumptions : 314
% 0.22/1.40 # Unit Clause-clause subsumption calls : 1715
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 38
% 0.22/1.40 # BW rewrite match successes : 17
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 31859
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.086 s
% 0.22/1.40 # System time : 0.002 s
% 0.22/1.40 # Total time : 0.088 s
% 0.22/1.40 # Maximum resident set size: 5132 pages
%------------------------------------------------------------------------------