TSTP Solution File: SEU240+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU240+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:18:12 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 : 35 ( 9 unt; 0 def)
% Number of atoms : 140 ( 0 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 169 ( 64 ~; 73 |; 19 &)
% ( 4 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 59 ( 4 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l2_wellord1,conjecture,
! [X1] :
( relation(X1)
=> ( transitive(X1)
<=> ! [X2,X3,X4] :
( ( in(ordered_pair(X2,X3),X1)
& in(ordered_pair(X3,X4),X1) )
=> in(ordered_pair(X2,X4),X1) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l2_wellord1) ).
fof(d8_relat_2,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( is_transitive_in(X1,X2)
<=> ! [X3,X4,X5] :
( ( in(X3,X2)
& in(X4,X2)
& in(X5,X2)
& in(ordered_pair(X3,X4),X1)
& in(ordered_pair(X4,X5),X1) )
=> in(ordered_pair(X3,X5),X1) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d8_relat_2) ).
fof(d16_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( transitive(X1)
<=> is_transitive_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d16_relat_2) ).
fof(t30_relat_1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( in(ordered_pair(X1,X2),X3)
=> ( in(X1,relation_field(X3))
& in(X2,relation_field(X3)) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t30_relat_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( transitive(X1)
<=> ! [X2,X3,X4] :
( ( in(ordered_pair(X2,X3),X1)
& in(ordered_pair(X3,X4),X1) )
=> in(ordered_pair(X2,X4),X1) ) ) ),
inference(assume_negation,[status(cth)],[l2_wellord1]) ).
fof(c_0_5,negated_conjecture,
! [X9,X10,X11] :
( relation(esk1_0)
& ( in(ordered_pair(esk2_0,esk3_0),esk1_0)
| ~ transitive(esk1_0) )
& ( in(ordered_pair(esk3_0,esk4_0),esk1_0)
| ~ transitive(esk1_0) )
& ( ~ in(ordered_pair(esk2_0,esk4_0),esk1_0)
| ~ transitive(esk1_0) )
& ( transitive(esk1_0)
| ~ in(ordered_pair(X9,X10),esk1_0)
| ~ in(ordered_pair(X10,X11),esk1_0)
| in(ordered_pair(X9,X11),esk1_0) ) ),
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)],[c_0_4])])])])])])]) ).
fof(c_0_6,plain,
! [X6,X7,X8,X9,X10,X7] :
( ( ~ is_transitive_in(X6,X7)
| ~ in(X8,X7)
| ~ in(X9,X7)
| ~ in(X10,X7)
| ~ in(ordered_pair(X8,X9),X6)
| ~ in(ordered_pair(X9,X10),X6)
| in(ordered_pair(X8,X10),X6)
| ~ relation(X6) )
& ( in(esk7_2(X6,X7),X7)
| is_transitive_in(X6,X7)
| ~ relation(X6) )
& ( in(esk8_2(X6,X7),X7)
| is_transitive_in(X6,X7)
| ~ relation(X6) )
& ( in(esk9_2(X6,X7),X7)
| is_transitive_in(X6,X7)
| ~ relation(X6) )
& ( in(ordered_pair(esk7_2(X6,X7),esk8_2(X6,X7)),X6)
| is_transitive_in(X6,X7)
| ~ relation(X6) )
& ( in(ordered_pair(esk8_2(X6,X7),esk9_2(X6,X7)),X6)
| is_transitive_in(X6,X7)
| ~ relation(X6) )
& ( ~ in(ordered_pair(esk7_2(X6,X7),esk9_2(X6,X7)),X6)
| is_transitive_in(X6,X7)
| ~ relation(X6) ) ),
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)],[d8_relat_2])])])])])])]) ).
cnf(c_0_7,negated_conjecture,
( in(ordered_pair(X1,X2),esk1_0)
| transitive(esk1_0)
| ~ in(ordered_pair(X3,X2),esk1_0)
| ~ in(ordered_pair(X1,X3),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( is_transitive_in(X1,X2)
| in(ordered_pair(esk8_2(X1,X2),esk9_2(X1,X2)),X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( is_transitive_in(X1,X2)
| ~ relation(X1)
| ~ in(ordered_pair(esk7_2(X1,X2),esk9_2(X1,X2)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
( is_transitive_in(esk1_0,X1)
| transitive(esk1_0)
| in(ordered_pair(X2,esk9_2(esk1_0,X1)),esk1_0)
| ~ in(ordered_pair(X2,esk8_2(esk1_0,X1)),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
fof(c_0_12,plain,
! [X2] :
( ( ~ transitive(X2)
| is_transitive_in(X2,relation_field(X2))
| ~ relation(X2) )
& ( ~ is_transitive_in(X2,relation_field(X2))
| transitive(X2)
| ~ relation(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d16_relat_2])])]) ).
cnf(c_0_13,negated_conjecture,
( is_transitive_in(esk1_0,X1)
| transitive(esk1_0)
| ~ in(ordered_pair(esk7_2(esk1_0,X1),esk8_2(esk1_0,X1)),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_9])]) ).
cnf(c_0_14,plain,
( is_transitive_in(X1,X2)
| in(ordered_pair(esk7_2(X1,X2),esk8_2(X1,X2)),X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,plain,
( transitive(X1)
| ~ relation(X1)
| ~ is_transitive_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( is_transitive_in(esk1_0,X1)
| transitive(esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_9])]) ).
cnf(c_0_17,negated_conjecture,
( in(ordered_pair(esk3_0,esk4_0),esk1_0)
| ~ transitive(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
transitive(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_9])]) ).
fof(c_0_19,plain,
! [X4,X5,X6] :
( ( in(X4,relation_field(X6))
| ~ in(ordered_pair(X4,X5),X6)
| ~ relation(X6) )
& ( in(X5,relation_field(X6))
| ~ in(ordered_pair(X4,X5),X6)
| ~ relation(X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t30_relat_1])])]) ).
cnf(c_0_20,plain,
( in(ordered_pair(X2,X3),X1)
| ~ relation(X1)
| ~ in(ordered_pair(X4,X3),X1)
| ~ in(ordered_pair(X2,X4),X1)
| ~ in(X3,X5)
| ~ in(X4,X5)
| ~ in(X2,X5)
| ~ is_transitive_in(X1,X5) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_21,negated_conjecture,
in(ordered_pair(esk3_0,esk4_0),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_22,plain,
( in(X2,relation_field(X1))
| ~ relation(X1)
| ~ in(ordered_pair(X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( in(X3,relation_field(X1))
| ~ relation(X1)
| ~ in(ordered_pair(X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( in(ordered_pair(esk2_0,esk3_0),esk1_0)
| ~ transitive(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_25,negated_conjecture,
( in(ordered_pair(X1,esk4_0),esk1_0)
| ~ is_transitive_in(esk1_0,X2)
| ~ in(ordered_pair(X1,esk3_0),esk1_0)
| ~ in(esk3_0,X2)
| ~ in(esk4_0,X2)
| ~ in(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_9])]) ).
cnf(c_0_26,plain,
( is_transitive_in(X1,relation_field(X1))
| ~ relation(X1)
| ~ transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_27,negated_conjecture,
in(esk3_0,relation_field(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_21]),c_0_9])]) ).
cnf(c_0_28,negated_conjecture,
in(esk4_0,relation_field(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_21]),c_0_9])]) ).
cnf(c_0_29,negated_conjecture,
in(ordered_pair(esk2_0,esk3_0),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_18])]) ).
cnf(c_0_30,negated_conjecture,
( ~ transitive(esk1_0)
| ~ in(ordered_pair(esk2_0,esk4_0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_31,negated_conjecture,
( in(ordered_pair(X1,esk4_0),esk1_0)
| ~ in(ordered_pair(X1,esk3_0),esk1_0)
| ~ in(X1,relation_field(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28]),c_0_18]),c_0_9])]) ).
cnf(c_0_32,negated_conjecture,
in(esk2_0,relation_field(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_29]),c_0_9])]) ).
cnf(c_0_33,negated_conjecture,
~ in(ordered_pair(esk2_0,esk4_0),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_18])]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_29])]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU240+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n003.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 01:14:14 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.016 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 : 35
% 0.23/1.41 # Proof object clause steps : 26
% 0.23/1.41 # Proof object formula steps : 9
% 0.23/1.41 # Proof object conjectures : 21
% 0.23/1.41 # Proof object clause conjectures : 18
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 13
% 0.23/1.41 # Proof object initial formulas used : 4
% 0.23/1.41 # Proof object generating inferences : 10
% 0.23/1.41 # Proof object simplifying inferences : 30
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 37
% 0.23/1.41 # Removed by relevancy pruning/SinE : 27
% 0.23/1.41 # Initial clauses : 22
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 22
% 0.23/1.41 # Processed clauses : 70
% 0.23/1.41 # ...of these trivial : 1
% 0.23/1.41 # ...subsumed : 8
% 0.23/1.41 # ...remaining for further processing : 61
% 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 : 10
% 0.23/1.41 # Backward-rewritten : 4
% 0.23/1.41 # Generated clauses : 84
% 0.23/1.41 # ...of the previous two non-trivial : 81
% 0.23/1.41 # Contextual simplify-reflections : 4
% 0.23/1.41 # Paramodulations : 84
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 47
% 0.23/1.41 # Positive orientable unit clauses : 8
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 8
% 0.23/1.41 # Non-unit-clauses : 31
% 0.23/1.41 # Current number of unprocessed clauses: 21
% 0.23/1.41 # ...number of literals in the above : 85
% 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) : 188
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 121
% 0.23/1.41 # Non-unit clause-clause subsumptions : 19
% 0.23/1.41 # Unit Clause-clause subsumption calls : 8
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 1
% 0.23/1.41 # BW rewrite match successes : 1
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 3215
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.021 s
% 0.23/1.41 # System time : 0.000 s
% 0.23/1.41 # Total time : 0.021 s
% 0.23/1.41 # Maximum resident set size: 3000 pages
%------------------------------------------------------------------------------