TSTP Solution File: SEU254+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU254+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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:20 EDT 2022
% Result : Theorem 0.27s 1.45s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 4 unt; 0 def)
% Number of atoms : 127 ( 0 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 151 ( 60 ~; 68 |; 12 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 87 ( 11 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t16_wellord1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_restriction(X3,X2))
<=> ( in(X1,X3)
& in(X1,cartesian_product2(X2,X2)) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t16_wellord1) ).
fof(l2_wellord1,axiom,
! [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/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l2_wellord1) ).
fof(dt_k2_wellord1,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_restriction(X1,X2)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k2_wellord1) ).
fof(t106_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
<=> ( in(X1,X3)
& in(X2,X4) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t106_zfmisc_1) ).
fof(t24_wellord1,conjecture,
! [X1,X2] :
( relation(X2)
=> ( transitive(X2)
=> transitive(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t24_wellord1) ).
fof(c_0_5,plain,
! [X4,X5,X6] :
( ( in(X4,X6)
| ~ in(X4,relation_restriction(X6,X5))
| ~ relation(X6) )
& ( in(X4,cartesian_product2(X5,X5))
| ~ in(X4,relation_restriction(X6,X5))
| ~ relation(X6) )
& ( ~ in(X4,X6)
| ~ in(X4,cartesian_product2(X5,X5))
| in(X4,relation_restriction(X6,X5))
| ~ relation(X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t16_wellord1])])]) ).
fof(c_0_6,plain,
! [X5,X6,X7,X8] :
( ( ~ transitive(X5)
| ~ in(ordered_pair(X6,X7),X5)
| ~ in(ordered_pair(X7,X8),X5)
| in(ordered_pair(X6,X8),X5)
| ~ relation(X5) )
& ( in(ordered_pair(esk3_1(X5),esk4_1(X5)),X5)
| transitive(X5)
| ~ relation(X5) )
& ( in(ordered_pair(esk4_1(X5),esk5_1(X5)),X5)
| transitive(X5)
| ~ relation(X5) )
& ( ~ in(ordered_pair(esk3_1(X5),esk5_1(X5)),X5)
| transitive(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)],[l2_wellord1])])])])])])]) ).
fof(c_0_7,plain,
! [X3,X4] :
( ~ relation(X3)
| relation(relation_restriction(X3,X4)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_wellord1])])])]) ).
fof(c_0_8,plain,
! [X5,X6,X7,X8,X5,X6,X7,X8] :
( ( in(X5,X7)
| ~ in(ordered_pair(X5,X6),cartesian_product2(X7,X8)) )
& ( in(X6,X8)
| ~ in(ordered_pair(X5,X6),cartesian_product2(X7,X8)) )
& ( ~ in(X5,X7)
| ~ in(X6,X8)
| in(ordered_pair(X5,X6),cartesian_product2(X7,X8)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t106_zfmisc_1])])])])]) ).
cnf(c_0_9,plain,
( in(X2,cartesian_product2(X3,X3))
| ~ relation(X1)
| ~ in(X2,relation_restriction(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( transitive(X1)
| in(ordered_pair(esk3_1(X1),esk4_1(X1)),X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( relation(relation_restriction(X1,X2))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( transitive(X1)
| in(ordered_pair(esk4_1(X1),esk5_1(X1)),X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( in(X2,relation_restriction(X1,X3))
| ~ relation(X1)
| ~ in(X2,cartesian_product2(X3,X3))
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
| ~ in(X2,X4)
| ~ in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( in(X1,X3)
| ~ in(ordered_pair(X1,X2),cartesian_product2(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( transitive(relation_restriction(X1,X2))
| in(ordered_pair(esk3_1(relation_restriction(X1,X2)),esk4_1(relation_restriction(X1,X2))),cartesian_product2(X2,X2))
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_17,plain,
( in(X2,X4)
| ~ in(ordered_pair(X1,X2),cartesian_product2(X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,plain,
( transitive(relation_restriction(X1,X2))
| in(ordered_pair(esk4_1(relation_restriction(X1,X2)),esk5_1(relation_restriction(X1,X2))),cartesian_product2(X2,X2))
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_12]),c_0_11]) ).
cnf(c_0_19,plain,
( in(X2,X1)
| ~ relation(X1)
| ~ in(X2,relation_restriction(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_20,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> ( transitive(X2)
=> transitive(relation_restriction(X2,X1)) ) ),
inference(assume_negation,[status(cth)],[t24_wellord1]) ).
cnf(c_0_21,plain,
( transitive(X1)
| ~ relation(X1)
| ~ in(ordered_pair(esk3_1(X1),esk5_1(X1)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,plain,
( in(ordered_pair(X1,X2),relation_restriction(X3,X4))
| ~ relation(X3)
| ~ in(ordered_pair(X1,X2),X3)
| ~ in(X2,X4)
| ~ in(X1,X4) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_23,plain,
( transitive(relation_restriction(X1,X2))
| in(esk3_1(relation_restriction(X1,X2)),X2)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,plain,
( transitive(relation_restriction(X1,X2))
| in(esk5_1(relation_restriction(X1,X2)),X2)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
( in(ordered_pair(X2,X3),X1)
| ~ relation(X1)
| ~ in(ordered_pair(X4,X3),X1)
| ~ in(ordered_pair(X2,X4),X1)
| ~ transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_26,plain,
( transitive(relation_restriction(X1,X2))
| in(ordered_pair(esk4_1(relation_restriction(X1,X2)),esk5_1(relation_restriction(X1,X2))),X1)
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_12]),c_0_11]) ).
fof(c_0_27,negated_conjecture,
( relation(esk2_0)
& transitive(esk2_0)
& ~ transitive(relation_restriction(esk2_0,esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])]) ).
cnf(c_0_28,plain,
( transitive(relation_restriction(X1,X2))
| ~ relation(X1)
| ~ in(ordered_pair(esk3_1(relation_restriction(X1,X2)),esk5_1(relation_restriction(X1,X2))),X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]),c_0_11]) ).
cnf(c_0_29,plain,
( transitive(relation_restriction(X1,X2))
| in(ordered_pair(X3,esk5_1(relation_restriction(X1,X2))),X1)
| ~ transitive(X1)
| ~ relation(X1)
| ~ in(ordered_pair(X3,esk4_1(relation_restriction(X1,X2))),X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
( transitive(relation_restriction(X1,X2))
| in(ordered_pair(esk3_1(relation_restriction(X1,X2)),esk4_1(relation_restriction(X1,X2))),X1)
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_10]),c_0_11]) ).
cnf(c_0_31,negated_conjecture,
~ transitive(relation_restriction(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
( transitive(relation_restriction(X1,X2))
| ~ transitive(X1)
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_33,negated_conjecture,
transitive(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SEU254+1 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.15 % Command : run_ET %s %d
% 0.15/0.36 % Computer : n010.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Mon Jun 20 00:12:37 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.27/1.45 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.27/1.45 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.27/1.45 # Preprocessing time : 0.017 s
% 0.27/1.45
% 0.27/1.45 # Proof found!
% 0.27/1.45 # SZS status Theorem
% 0.27/1.45 # SZS output start CNFRefutation
% See solution above
% 0.27/1.46 # Proof object total steps : 36
% 0.27/1.46 # Proof object clause steps : 25
% 0.27/1.46 # Proof object formula steps : 11
% 0.27/1.46 # Proof object conjectures : 7
% 0.27/1.46 # Proof object clause conjectures : 4
% 0.27/1.46 # Proof object formula conjectures : 3
% 0.27/1.46 # Proof object initial clauses used : 14
% 0.27/1.46 # Proof object initial formulas used : 5
% 0.27/1.46 # Proof object generating inferences : 11
% 0.27/1.46 # Proof object simplifying inferences : 11
% 0.27/1.46 # Training examples: 0 positive, 0 negative
% 0.27/1.46 # Parsed axioms : 34
% 0.27/1.46 # Removed by relevancy pruning/SinE : 17
% 0.27/1.46 # Initial clauses : 26
% 0.27/1.46 # Removed in clause preprocessing : 0
% 0.27/1.46 # Initial clauses in saturation : 26
% 0.27/1.46 # Processed clauses : 744
% 0.27/1.46 # ...of these trivial : 1
% 0.27/1.46 # ...subsumed : 502
% 0.27/1.46 # ...remaining for further processing : 241
% 0.27/1.46 # Other redundant clauses eliminated : 0
% 0.27/1.46 # Clauses deleted for lack of memory : 0
% 0.27/1.46 # Backward-subsumed : 31
% 0.27/1.46 # Backward-rewritten : 3
% 0.27/1.46 # Generated clauses : 1438
% 0.27/1.46 # ...of the previous two non-trivial : 1391
% 0.27/1.46 # Contextual simplify-reflections : 552
% 0.27/1.46 # Paramodulations : 1438
% 0.27/1.46 # Factorizations : 0
% 0.27/1.46 # Equation resolutions : 0
% 0.27/1.46 # Current number of processed clauses : 207
% 0.27/1.46 # Positive orientable unit clauses : 7
% 0.27/1.46 # Positive unorientable unit clauses: 1
% 0.27/1.46 # Negative unit clauses : 6
% 0.27/1.46 # Non-unit-clauses : 193
% 0.27/1.46 # Current number of unprocessed clauses: 576
% 0.27/1.46 # ...number of literals in the above : 2799
% 0.27/1.46 # Current number of archived formulas : 0
% 0.27/1.46 # Current number of archived clauses : 34
% 0.27/1.46 # Clause-clause subsumption calls (NU) : 30217
% 0.27/1.46 # Rec. Clause-clause subsumption calls : 15866
% 0.27/1.46 # Non-unit clause-clause subsumptions : 1085
% 0.27/1.46 # Unit Clause-clause subsumption calls : 79
% 0.27/1.46 # Rewrite failures with RHS unbound : 0
% 0.27/1.46 # BW rewrite match attempts : 6
% 0.27/1.46 # BW rewrite match successes : 5
% 0.27/1.46 # Condensation attempts : 0
% 0.27/1.46 # Condensation successes : 0
% 0.27/1.46 # Termbank termtop insertions : 32174
% 0.27/1.46
% 0.27/1.46 # -------------------------------------------------
% 0.27/1.46 # User time : 0.104 s
% 0.27/1.46 # System time : 0.003 s
% 0.27/1.46 # Total time : 0.107 s
% 0.27/1.46 # Maximum resident set size: 4036 pages
% 0.29/24.22 eprover: CPU time limit exceeded, terminating
% 0.29/24.24 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/24.24 eprover: No such file or directory
% 0.29/24.24 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/24.24 eprover: No such file or directory
% 0.29/24.25 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/24.25 eprover: No such file or directory
% 0.29/24.25 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/24.25 eprover: No such file or directory
% 0.29/24.26 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/24.26 eprover: No such file or directory
% 0.29/24.27 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/24.27 eprover: No such file or directory
% 0.29/24.27 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/24.27 eprover: No such file or directory
% 0.29/24.28 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.29/24.28 eprover: No such file or directory
%------------------------------------------------------------------------------