TSTP Solution File: SEU239+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU239+2 : 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:18:12 EDT 2022
% Result : Theorem 0.28s 1.46s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 5 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 87 ( 33 ~; 37 |; 6 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 27 ( 1 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l1_wellord1,conjecture,
! [X1] :
( relation(X1)
=> ( reflexive(X1)
<=> ! [X2] :
( in(X2,relation_field(X1))
=> in(ordered_pair(X2,X2),X1) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l1_wellord1) ).
fof(d1_relat_2,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( is_reflexive_in(X1,X2)
<=> ! [X3] :
( in(X3,X2)
=> in(ordered_pair(X3,X3),X1) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_relat_2) ).
fof(d9_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( reflexive(X1)
<=> is_reflexive_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d9_relat_2) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( reflexive(X1)
<=> ! [X2] :
( in(X2,relation_field(X1))
=> in(ordered_pair(X2,X2),X1) ) ) ),
inference(assume_negation,[status(cth)],[l1_wellord1]) ).
fof(c_0_4,negated_conjecture,
! [X5] :
( relation(esk1_0)
& ( in(esk2_0,relation_field(esk1_0))
| ~ reflexive(esk1_0) )
& ( ~ in(ordered_pair(esk2_0,esk2_0),esk1_0)
| ~ reflexive(esk1_0) )
& ( reflexive(esk1_0)
| ~ in(X5,relation_field(esk1_0))
| in(ordered_pair(X5,X5),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_3])])])])])])]) ).
fof(c_0_5,plain,
! [X4,X5,X6,X5] :
( ( ~ is_reflexive_in(X4,X5)
| ~ in(X6,X5)
| in(ordered_pair(X6,X6),X4)
| ~ relation(X4) )
& ( in(esk30_2(X4,X5),X5)
| is_reflexive_in(X4,X5)
| ~ relation(X4) )
& ( ~ in(ordered_pair(esk30_2(X4,X5),esk30_2(X4,X5)),X4)
| is_reflexive_in(X4,X5)
| ~ relation(X4) ) ),
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_2])])])])])])]) ).
cnf(c_0_6,negated_conjecture,
( in(ordered_pair(X1,X1),esk1_0)
| reflexive(esk1_0)
| ~ in(X1,relation_field(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( is_reflexive_in(X1,X2)
| in(esk30_2(X1,X2),X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X2] :
( ( ~ reflexive(X2)
| is_reflexive_in(X2,relation_field(X2))
| ~ relation(X2) )
& ( ~ is_reflexive_in(X2,relation_field(X2))
| reflexive(X2)
| ~ relation(X2) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_relat_2])])]) ).
cnf(c_0_9,plain,
( is_reflexive_in(X1,X2)
| ~ relation(X1)
| ~ in(ordered_pair(esk30_2(X1,X2),esk30_2(X1,X2)),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( reflexive(esk1_0)
| is_reflexive_in(X1,relation_field(esk1_0))
| in(ordered_pair(esk30_2(X1,relation_field(esk1_0)),esk30_2(X1,relation_field(esk1_0))),esk1_0)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,plain,
( reflexive(X1)
| ~ relation(X1)
| ~ is_reflexive_in(X1,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( reflexive(esk1_0)
| is_reflexive_in(esk1_0,relation_field(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_14,plain,
( in(ordered_pair(X2,X2),X1)
| ~ relation(X1)
| ~ in(X2,X3)
| ~ is_reflexive_in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( is_reflexive_in(X1,relation_field(X1))
| ~ relation(X1)
| ~ reflexive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,negated_conjecture,
( in(esk2_0,relation_field(esk1_0))
| ~ reflexive(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,negated_conjecture,
reflexive(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_11])]) ).
cnf(c_0_18,plain,
( in(ordered_pair(X1,X1),X2)
| ~ reflexive(X2)
| ~ relation(X2)
| ~ in(X1,relation_field(X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
in(esk2_0,relation_field(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_20,negated_conjecture,
( ~ reflexive(esk1_0)
| ~ in(ordered_pair(esk2_0,esk2_0),esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_21,negated_conjecture,
in(ordered_pair(esk2_0,esk2_0),esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_17]),c_0_11])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_17])]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SEU239+2 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.14 % Command : run_ET %s %d
% 0.15/0.36 % Computer : n007.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 : Sun Jun 19 09:17:59 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.28/1.46 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.28/1.46 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.28/1.46 # Preprocessing time : 0.030 s
% 0.28/1.46
% 0.28/1.46 # Proof found!
% 0.28/1.46 # SZS status Theorem
% 0.28/1.46 # SZS output start CNFRefutation
% See solution above
% 0.28/1.46 # Proof object total steps : 23
% 0.28/1.46 # Proof object clause steps : 16
% 0.28/1.46 # Proof object formula steps : 7
% 0.28/1.46 # Proof object conjectures : 13
% 0.28/1.46 # Proof object clause conjectures : 10
% 0.28/1.46 # Proof object formula conjectures : 3
% 0.28/1.46 # Proof object initial clauses used : 9
% 0.28/1.46 # Proof object initial formulas used : 3
% 0.28/1.46 # Proof object generating inferences : 5
% 0.28/1.46 # Proof object simplifying inferences : 13
% 0.28/1.46 # Training examples: 0 positive, 0 negative
% 0.28/1.46 # Parsed axioms : 283
% 0.28/1.46 # Removed by relevancy pruning/SinE : 182
% 0.28/1.46 # Initial clauses : 179
% 0.28/1.46 # Removed in clause preprocessing : 3
% 0.28/1.46 # Initial clauses in saturation : 176
% 0.28/1.46 # Processed clauses : 773
% 0.28/1.46 # ...of these trivial : 20
% 0.28/1.46 # ...subsumed : 302
% 0.28/1.46 # ...remaining for further processing : 450
% 0.28/1.46 # Other redundant clauses eliminated : 53
% 0.28/1.46 # Clauses deleted for lack of memory : 0
% 0.28/1.46 # Backward-subsumed : 37
% 0.28/1.46 # Backward-rewritten : 129
% 0.28/1.46 # Generated clauses : 3520
% 0.28/1.46 # ...of the previous two non-trivial : 2907
% 0.28/1.46 # Contextual simplify-reflections : 122
% 0.28/1.46 # Paramodulations : 3422
% 0.28/1.46 # Factorizations : 14
% 0.28/1.46 # Equation resolutions : 84
% 0.28/1.46 # Current number of processed clauses : 281
% 0.28/1.46 # Positive orientable unit clauses : 54
% 0.28/1.46 # Positive unorientable unit clauses: 2
% 0.28/1.46 # Negative unit clauses : 18
% 0.28/1.46 # Non-unit-clauses : 207
% 0.28/1.46 # Current number of unprocessed clauses: 1542
% 0.28/1.46 # ...number of literals in the above : 4823
% 0.28/1.46 # Current number of archived formulas : 0
% 0.28/1.46 # Current number of archived clauses : 167
% 0.28/1.46 # Clause-clause subsumption calls (NU) : 22560
% 0.28/1.46 # Rec. Clause-clause subsumption calls : 14864
% 0.28/1.46 # Non-unit clause-clause subsumptions : 301
% 0.28/1.46 # Unit Clause-clause subsumption calls : 3664
% 0.28/1.46 # Rewrite failures with RHS unbound : 0
% 0.28/1.46 # BW rewrite match attempts : 59
% 0.28/1.46 # BW rewrite match successes : 32
% 0.28/1.46 # Condensation attempts : 0
% 0.28/1.46 # Condensation successes : 0
% 0.28/1.46 # Termbank termtop insertions : 49126
% 0.28/1.46
% 0.28/1.46 # -------------------------------------------------
% 0.28/1.46 # User time : 0.130 s
% 0.28/1.46 # System time : 0.006 s
% 0.28/1.46 # Total time : 0.136 s
% 0.28/1.46 # Maximum resident set size: 5960 pages
% 0.28/23.46 eprover: CPU time limit exceeded, terminating
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.47 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.48 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.49 eprover: No such file or directory
% 0.28/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.50 eprover: No such file or directory
% 0.28/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.50 eprover: No such file or directory
% 0.28/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.28/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------