TSTP Solution File: SEU187+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU187+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n003.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 : 8
% Number of leaves : 10
% Syntax : Number of formulae : 47 ( 8 unt; 0 def)
% Number of atoms : 140 ( 49 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 166 ( 73 ~; 69 |; 14 &)
% ( 5 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 3 con; 0-3 aty)
% Number of variables : 76 ( 7 sgn 37 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
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(d5_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X4,X3),X1) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d5_relat_1) ).
fof(cc1_relat_1,axiom,
! [X1] :
( empty(X1)
=> relation(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',cc1_relat_1) ).
fof(t2_tarski,axiom,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
<=> in(X3,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_tarski) ).
fof(t60_relat_1,conjecture,
( relation_dom(empty_set) = empty_set
& relation_rng(empty_set) = empty_set ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t60_relat_1) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t6_boole) ).
fof(rc1_relat_1,axiom,
? [X1] :
( empty(X1)
& relation(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rc1_relat_1) ).
fof(t8_boole,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t8_boole) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rc1_xboole_0) ).
fof(d4_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_dom(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X3,X4),X1) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d4_relat_1) ).
fof(c_0_10,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
fof(c_0_11,plain,
! [X5,X6,X7,X7,X9,X6,X11] :
( ( ~ in(X7,X6)
| in(ordered_pair(esk1_3(X5,X6,X7),X7),X5)
| X6 != relation_rng(X5)
| ~ relation(X5) )
& ( ~ in(ordered_pair(X9,X7),X5)
| in(X7,X6)
| X6 != relation_rng(X5)
| ~ relation(X5) )
& ( ~ in(esk2_2(X5,X6),X6)
| ~ in(ordered_pair(X11,esk2_2(X5,X6)),X5)
| X6 = relation_rng(X5)
| ~ relation(X5) )
& ( in(esk2_2(X5,X6),X6)
| in(ordered_pair(esk3_2(X5,X6),esk2_2(X5,X6)),X5)
| X6 = relation_rng(X5)
| ~ 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)],[d5_relat_1])])])])])])]) ).
fof(c_0_12,plain,
! [X2] :
( ~ empty(X2)
| relation(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relat_1])]) ).
fof(c_0_13,plain,
! [X4,X5] :
( ( ~ in(esk11_2(X4,X5),X4)
| ~ in(esk11_2(X4,X5),X5)
| X4 = X5 )
& ( in(esk11_2(X4,X5),X4)
| in(esk11_2(X4,X5),X5)
| X4 = X5 ) ),
inference(distribute,[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)],[t2_tarski])])])])])]) ).
fof(c_0_14,negated_conjecture,
~ ( relation_dom(empty_set) = empty_set
& relation_rng(empty_set) = empty_set ),
inference(assume_negation,[status(cth)],[t60_relat_1]) ).
fof(c_0_15,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_16,plain,
( empty(esk9_0)
& relation(esk9_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_relat_1])]) ).
fof(c_0_17,plain,
! [X3,X4] :
( ~ empty(X3)
| X3 = X4
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_boole])]) ).
fof(c_0_18,plain,
empty(esk7_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
cnf(c_0_19,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,plain,
( in(ordered_pair(esk1_3(X1,X2,X3),X3),X1)
| ~ relation(X1)
| X2 != relation_rng(X1)
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
( relation(X1)
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
( X1 = X2
| in(esk11_2(X1,X2),X2)
| in(esk11_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_23,plain,
! [X5,X6,X7,X7,X9,X6,X11] :
( ( ~ in(X7,X6)
| in(ordered_pair(X7,esk4_3(X5,X6,X7)),X5)
| X6 != relation_dom(X5)
| ~ relation(X5) )
& ( ~ in(ordered_pair(X7,X9),X5)
| in(X7,X6)
| X6 != relation_dom(X5)
| ~ relation(X5) )
& ( ~ in(esk5_2(X5,X6),X6)
| ~ in(ordered_pair(esk5_2(X5,X6),X11),X5)
| X6 = relation_dom(X5)
| ~ relation(X5) )
& ( in(esk5_2(X5,X6),X6)
| in(ordered_pair(esk5_2(X5,X6),esk6_2(X5,X6)),X5)
| X6 = relation_dom(X5)
| ~ 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)],[d4_relat_1])])])])])])]) ).
fof(c_0_24,negated_conjecture,
( relation_dom(empty_set) != empty_set
| relation_rng(empty_set) != empty_set ),
inference(fof_nnf,[status(thm)],[c_0_14]) ).
cnf(c_0_25,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
empty(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_27,plain,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_28,plain,
empty(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_29,plain,
( X1 != relation_rng(X2)
| ~ empty(X2)
| ~ in(X3,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_30,plain,
( X1 = X2
| in(esk11_2(X1,X2),X1)
| ~ empty(X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_31,plain,
( in(ordered_pair(X3,esk4_3(X1,X2,X3)),X1)
| ~ relation(X1)
| X2 != relation_dom(X1)
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,negated_conjecture,
( relation_rng(empty_set) != empty_set
| relation_dom(empty_set) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
empty_set = esk9_0,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,plain,
( X1 = esk7_0
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
( X1 = X2
| X1 != relation_rng(X3)
| ~ empty(X3)
| ~ empty(X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_36,plain,
( X1 != relation_dom(X2)
| ~ empty(X2)
| ~ in(X3,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_31]),c_0_21]) ).
cnf(c_0_37,negated_conjecture,
( relation_dom(esk9_0) != esk9_0
| relation_rng(esk9_0) != esk9_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_33]),c_0_33]),c_0_33]) ).
cnf(c_0_38,plain,
esk9_0 = esk7_0,
inference(spm,[status(thm)],[c_0_34,c_0_26]) ).
cnf(c_0_39,plain,
( relation_rng(X1) = X2
| ~ empty(X1)
| ~ empty(X2) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_40,plain,
( X1 = X2
| X1 != relation_dom(X3)
| ~ empty(X3)
| ~ empty(X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_30]) ).
cnf(c_0_41,negated_conjecture,
( relation_dom(esk7_0) != esk7_0
| relation_rng(esk7_0) != esk7_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38]),c_0_38]),c_0_38]),c_0_38]) ).
cnf(c_0_42,plain,
( relation_rng(X1) = esk7_0
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_28]) ).
cnf(c_0_43,plain,
( relation_dom(X1) = X2
| ~ empty(X1)
| ~ empty(X2) ),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_44,negated_conjecture,
relation_dom(esk7_0) != esk7_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_28])]) ).
cnf(c_0_45,plain,
( relation_dom(X1) = esk7_0
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_28]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU187+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n003.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 : Sun Jun 19 21:47:44 EDT 2022
% 0.13/0.34 % 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.016 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 : 47
% 0.22/1.40 # Proof object clause steps : 26
% 0.22/1.40 # Proof object formula steps : 21
% 0.22/1.40 # Proof object conjectures : 8
% 0.22/1.40 # Proof object clause conjectures : 5
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 10
% 0.22/1.40 # Proof object initial formulas used : 10
% 0.22/1.40 # Proof object generating inferences : 14
% 0.22/1.40 # Proof object simplifying inferences : 14
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 32
% 0.22/1.40 # Removed by relevancy pruning/SinE : 14
% 0.22/1.40 # Initial clauses : 28
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 28
% 0.22/1.40 # Processed clauses : 61
% 0.22/1.40 # ...of these trivial : 2
% 0.22/1.40 # ...subsumed : 7
% 0.22/1.40 # ...remaining for further processing : 52
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 1
% 0.22/1.40 # Backward-rewritten : 8
% 0.22/1.40 # Generated clauses : 81
% 0.22/1.40 # ...of the previous two non-trivial : 77
% 0.22/1.40 # Contextual simplify-reflections : 4
% 0.22/1.40 # Paramodulations : 77
% 0.22/1.40 # Factorizations : 2
% 0.22/1.40 # Equation resolutions : 2
% 0.22/1.40 # Current number of processed clauses : 43
% 0.22/1.40 # Positive orientable unit clauses : 5
% 0.22/1.40 # Positive unorientable unit clauses: 0
% 0.22/1.40 # Negative unit clauses : 4
% 0.22/1.40 # Non-unit-clauses : 34
% 0.22/1.40 # Current number of unprocessed clauses: 41
% 0.22/1.40 # ...number of literals in the above : 185
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 9
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 428
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 275
% 0.22/1.40 # Non-unit clause-clause subsumptions : 12
% 0.22/1.40 # Unit Clause-clause subsumption calls : 72
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 2
% 0.22/1.40 # BW rewrite match successes : 2
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 2577
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.018 s
% 0.22/1.40 # System time : 0.002 s
% 0.22/1.40 # Total time : 0.020 s
% 0.22/1.40 # Maximum resident set size: 2976 pages
%------------------------------------------------------------------------------