TSTP Solution File: SEU179+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU179+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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:31 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 36 ( 6 unt; 0 def)
% Number of atoms : 130 ( 18 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 147 ( 53 ~; 67 |; 13 &)
% ( 5 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 2 con; 0-3 aty)
% Number of variables : 76 ( 8 sgn 32 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
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',d4_relat_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',d3_tarski) ).
fof(t25_relat_1,conjecture,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ( subset(X1,X2)
=> ( subset(relation_dom(X1),relation_dom(X2))
& subset(relation_rng(X1),relation_rng(X2)) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t25_relat_1) ).
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',d5_relat_1) ).
fof(c_0_4,plain,
! [X5,X6,X7,X7,X9,X6,X11] :
( ( ~ in(X7,X6)
| in(ordered_pair(X7,esk7_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(esk8_2(X5,X6),X6)
| ~ in(ordered_pair(esk8_2(X5,X6),X11),X5)
| X6 = relation_dom(X5)
| ~ relation(X5) )
& ( in(esk8_2(X5,X6),X6)
| in(ordered_pair(esk8_2(X5,X6),esk9_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_5,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk3_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk3_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])])])])])])]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ( subset(X1,X2)
=> ( subset(relation_dom(X1),relation_dom(X2))
& subset(relation_rng(X1),relation_rng(X2)) ) ) ) ),
inference(assume_negation,[status(cth)],[t25_relat_1]) ).
cnf(c_0_7,plain,
( in(ordered_pair(X3,esk7_3(X1,X2,X3)),X1)
| ~ relation(X1)
| X2 != relation_dom(X1)
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,plain,
! [X5,X6,X7,X7,X9,X6,X11] :
( ( ~ in(X7,X6)
| in(ordered_pair(esk4_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(esk5_2(X5,X6),X6)
| ~ in(ordered_pair(X11,esk5_2(X5,X6)),X5)
| X6 = relation_rng(X5)
| ~ relation(X5) )
& ( in(esk5_2(X5,X6),X6)
| in(ordered_pair(esk6_2(X5,X6),esk5_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_10,negated_conjecture,
( relation(esk1_0)
& relation(esk2_0)
& subset(esk1_0,esk2_0)
& ( ~ subset(relation_dom(esk1_0),relation_dom(esk2_0))
| ~ subset(relation_rng(esk1_0),relation_rng(esk2_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_6])])])])]) ).
cnf(c_0_11,plain,
( subset(X1,X2)
| in(ordered_pair(esk3_2(X1,X2),esk7_3(X3,X1,esk3_2(X1,X2))),X3)
| X1 != relation_dom(X3)
| ~ relation(X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( in(ordered_pair(esk4_3(X1,X2,X3),X3),X1)
| ~ relation(X1)
| X2 != relation_rng(X1)
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( subset(relation_dom(X1),X2)
| in(ordered_pair(esk3_2(relation_dom(X1),X2),esk7_3(X1,relation_dom(X1),esk3_2(relation_dom(X1),X2))),X1)
| ~ relation(X1) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( subset(X1,X2)
| in(ordered_pair(esk4_3(X3,X1,esk3_2(X1,X2)),esk3_2(X1,X2)),X3)
| X1 != relation_rng(X3)
| ~ relation(X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_8]) ).
cnf(c_0_18,negated_conjecture,
( in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( subset(relation_dom(esk1_0),X1)
| in(ordered_pair(esk3_2(relation_dom(esk1_0),X1),esk7_3(esk1_0,relation_dom(esk1_0),esk3_2(relation_dom(esk1_0),X1))),esk1_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( subset(relation_rng(X1),X2)
| in(ordered_pair(esk4_3(X1,relation_rng(X1),esk3_2(relation_rng(X1),X2)),esk3_2(relation_rng(X1),X2)),X1)
| ~ relation(X1) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
( in(X3,X2)
| ~ relation(X1)
| X2 != relation_dom(X1)
| ~ in(ordered_pair(X3,X4),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_22,negated_conjecture,
( subset(relation_dom(esk1_0),X1)
| in(ordered_pair(esk3_2(relation_dom(esk1_0),X1),esk7_3(esk1_0,relation_dom(esk1_0),esk3_2(relation_dom(esk1_0),X1))),esk2_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_24,negated_conjecture,
( subset(relation_rng(esk1_0),X1)
| in(ordered_pair(esk4_3(esk1_0,relation_rng(esk1_0),esk3_2(relation_rng(esk1_0),X1)),esk3_2(relation_rng(esk1_0),X1)),esk1_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_25,negated_conjecture,
( subset(relation_dom(esk1_0),X1)
| in(esk3_2(relation_dom(esk1_0),X1),X2)
| X2 != relation_dom(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).
cnf(c_0_26,plain,
( in(X3,X2)
| ~ relation(X1)
| X2 != relation_rng(X1)
| ~ in(ordered_pair(X4,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,negated_conjecture,
( subset(relation_rng(esk1_0),X1)
| in(ordered_pair(esk4_3(esk1_0,relation_rng(esk1_0),esk3_2(relation_rng(esk1_0),X1)),esk3_2(relation_rng(esk1_0),X1)),esk2_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_24]) ).
cnf(c_0_28,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_29,negated_conjecture,
( subset(relation_dom(esk1_0),X1)
| in(esk3_2(relation_dom(esk1_0),X1),relation_dom(esk2_0)) ),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( subset(relation_rng(esk1_0),X1)
| in(esk3_2(relation_rng(esk1_0),X1),X2)
| X2 != relation_rng(esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_23])]) ).
cnf(c_0_31,negated_conjecture,
( ~ subset(relation_rng(esk1_0),relation_rng(esk2_0))
| ~ subset(relation_dom(esk1_0),relation_dom(esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_32,negated_conjecture,
subset(relation_dom(esk1_0),relation_dom(esk2_0)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( subset(relation_rng(esk1_0),X1)
| in(esk3_2(relation_rng(esk1_0),X1),relation_rng(esk2_0)) ),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_34,negated_conjecture,
~ subset(relation_rng(esk1_0),relation_rng(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU179+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n007.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 03:07:58 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.23/1.41 # Preprocessing time : 0.017 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 36
% 0.23/1.41 # Proof object clause steps : 27
% 0.23/1.41 # Proof object formula steps : 9
% 0.23/1.41 # Proof object conjectures : 19
% 0.23/1.41 # Proof object clause conjectures : 16
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 11
% 0.23/1.41 # Proof object initial formulas used : 4
% 0.23/1.41 # Proof object generating inferences : 15
% 0.23/1.41 # Proof object simplifying inferences : 7
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 35
% 0.23/1.41 # Removed by relevancy pruning/SinE : 14
% 0.23/1.41 # Initial clauses : 36
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 36
% 0.23/1.41 # Processed clauses : 1458
% 0.23/1.41 # ...of these trivial : 3
% 0.23/1.41 # ...subsumed : 412
% 0.23/1.41 # ...remaining for further processing : 1043
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 0
% 0.23/1.41 # Backward-rewritten : 14
% 0.23/1.41 # Generated clauses : 2594
% 0.23/1.41 # ...of the previous two non-trivial : 2464
% 0.23/1.41 # Contextual simplify-reflections : 69
% 0.23/1.41 # Paramodulations : 2367
% 0.23/1.41 # Factorizations : 20
% 0.23/1.41 # Equation resolutions : 204
% 0.23/1.41 # Current number of processed clauses : 1028
% 0.23/1.41 # Positive orientable unit clauses : 32
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 10
% 0.23/1.41 # Non-unit-clauses : 986
% 0.23/1.41 # Current number of unprocessed clauses: 1024
% 0.23/1.41 # ...number of literals in the above : 3314
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 14
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 153713
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 72210
% 0.23/1.41 # Non-unit clause-clause subsumptions : 458
% 0.23/1.41 # Unit Clause-clause subsumption calls : 3853
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 33
% 0.23/1.41 # BW rewrite match successes : 8
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 66487
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.161 s
% 0.23/1.41 # System time : 0.010 s
% 0.23/1.41 # Total time : 0.171 s
% 0.23/1.41 # Maximum resident set size: 6700 pages
%------------------------------------------------------------------------------