TSTP Solution File: SEU243+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU243+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n015.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:14 EDT 2022
% Result : Theorem 0.24s 1.43s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 40 ( 8 unt; 0 def)
% Number of atoms : 161 ( 24 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 209 ( 88 ~; 96 |; 16 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 61 ( 1 sgn 19 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
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_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rc1_xboole_0) ).
fof(d3_wellord1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( is_well_founded_in(X1,X2)
<=> ! [X3] :
~ ( subset(X3,X2)
& X3 != empty_set
& ! [X4] :
~ ( in(X4,X3)
& disjoint(fiber(X1,X4),X3) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_wellord1) ).
fof(d2_wellord1,axiom,
! [X1] :
( relation(X1)
=> ( well_founded_relation(X1)
<=> ! [X2] :
~ ( subset(X2,relation_field(X1))
& X2 != empty_set
& ! [X3] :
~ ( in(X3,X2)
& disjoint(fiber(X1,X3),X2) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d2_wellord1) ).
fof(t5_wellord1,conjecture,
! [X1] :
( relation(X1)
=> ( well_founded_relation(X1)
<=> is_well_founded_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t5_wellord1) ).
fof(c_0_5,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_6,plain,
empty(esk7_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
fof(c_0_7,plain,
! [X5,X6,X7,X6,X10] :
( ( in(esk2_3(X5,X6,X7),X7)
| ~ subset(X7,X6)
| X7 = empty_set
| ~ is_well_founded_in(X5,X6)
| ~ relation(X5) )
& ( disjoint(fiber(X5,esk2_3(X5,X6,X7)),X7)
| ~ subset(X7,X6)
| X7 = empty_set
| ~ is_well_founded_in(X5,X6)
| ~ relation(X5) )
& ( subset(esk3_2(X5,X6),X6)
| is_well_founded_in(X5,X6)
| ~ relation(X5) )
& ( esk3_2(X5,X6) != empty_set
| is_well_founded_in(X5,X6)
| ~ relation(X5) )
& ( ~ in(X10,esk3_2(X5,X6))
| ~ disjoint(fiber(X5,X10),esk3_2(X5,X6))
| is_well_founded_in(X5,X6)
| ~ 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)],[d3_wellord1])])])])])])]) ).
cnf(c_0_8,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
empty(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X4,X5,X8] :
( ( in(esk4_2(X4,X5),X5)
| ~ subset(X5,relation_field(X4))
| X5 = empty_set
| ~ well_founded_relation(X4)
| ~ relation(X4) )
& ( disjoint(fiber(X4,esk4_2(X4,X5)),X5)
| ~ subset(X5,relation_field(X4))
| X5 = empty_set
| ~ well_founded_relation(X4)
| ~ relation(X4) )
& ( subset(esk5_1(X4),relation_field(X4))
| well_founded_relation(X4)
| ~ relation(X4) )
& ( esk5_1(X4) != empty_set
| well_founded_relation(X4)
| ~ relation(X4) )
& ( ~ in(X8,esk5_1(X4))
| ~ disjoint(fiber(X4,X8),esk5_1(X4))
| well_founded_relation(X4)
| ~ 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)],[d2_wellord1])])])])])])]) ).
cnf(c_0_11,plain,
( X3 = empty_set
| disjoint(fiber(X1,esk2_3(X1,X2,X3)),X3)
| ~ relation(X1)
| ~ is_well_founded_in(X1,X2)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
empty_set = esk7_0,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( X3 = empty_set
| in(esk2_3(X1,X2,X3),X3)
| ~ relation(X1)
| ~ is_well_founded_in(X1,X2)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( well_founded_relation(X1)
| ~ relation(X1)
| esk5_1(X1) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( well_founded_relation(X1)
| ~ relation(X1)
| ~ disjoint(fiber(X1,X2),esk5_1(X1))
| ~ in(X2,esk5_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( X1 = esk7_0
| disjoint(fiber(X2,esk2_3(X2,X3,X1)),X1)
| ~ is_well_founded_in(X2,X3)
| ~ subset(X1,X3)
| ~ relation(X2) ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( X1 = esk7_0
| in(esk2_3(X2,X3,X1),X1)
| ~ is_well_founded_in(X2,X3)
| ~ subset(X1,X3)
| ~ relation(X2) ),
inference(rw,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_18,plain,
( well_founded_relation(X1)
| esk5_1(X1) != esk7_0
| ~ relation(X1) ),
inference(rw,[status(thm)],[c_0_14,c_0_12]) ).
fof(c_0_19,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( well_founded_relation(X1)
<=> is_well_founded_in(X1,relation_field(X1)) ) ),
inference(assume_negation,[status(cth)],[t5_wellord1]) ).
cnf(c_0_20,plain,
( well_founded_relation(X1)
| ~ is_well_founded_in(X1,X2)
| ~ subset(esk5_1(X1),X2)
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18]) ).
cnf(c_0_21,plain,
( well_founded_relation(X1)
| subset(esk5_1(X1),relation_field(X1))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_22,negated_conjecture,
( relation(esk1_0)
& ( ~ well_founded_relation(esk1_0)
| ~ is_well_founded_in(esk1_0,relation_field(esk1_0)) )
& ( well_founded_relation(esk1_0)
| is_well_founded_in(esk1_0,relation_field(esk1_0)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
cnf(c_0_23,plain,
( X2 = empty_set
| disjoint(fiber(X1,esk4_2(X1,X2)),X2)
| ~ relation(X1)
| ~ well_founded_relation(X1)
| ~ subset(X2,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_24,plain,
( X2 = empty_set
| in(esk4_2(X1,X2),X2)
| ~ relation(X1)
| ~ well_founded_relation(X1)
| ~ subset(X2,relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_25,plain,
( is_well_founded_in(X1,X2)
| ~ relation(X1)
| esk3_2(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_26,plain,
( well_founded_relation(X1)
| ~ is_well_founded_in(X1,relation_field(X1))
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( is_well_founded_in(esk1_0,relation_field(esk1_0))
| well_founded_relation(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
relation(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
( is_well_founded_in(X1,X2)
| ~ relation(X1)
| ~ disjoint(fiber(X1,X3),esk3_2(X1,X2))
| ~ in(X3,esk3_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_30,plain,
( X1 = esk7_0
| disjoint(fiber(X2,esk4_2(X2,X1)),X1)
| ~ subset(X1,relation_field(X2))
| ~ well_founded_relation(X2)
| ~ relation(X2) ),
inference(rw,[status(thm)],[c_0_23,c_0_12]) ).
cnf(c_0_31,plain,
( X1 = esk7_0
| in(esk4_2(X2,X1),X1)
| ~ subset(X1,relation_field(X2))
| ~ well_founded_relation(X2)
| ~ relation(X2) ),
inference(rw,[status(thm)],[c_0_24,c_0_12]) ).
cnf(c_0_32,plain,
( is_well_founded_in(X1,X2)
| esk3_2(X1,X2) != esk7_0
| ~ relation(X1) ),
inference(rw,[status(thm)],[c_0_25,c_0_12]) ).
cnf(c_0_33,negated_conjecture,
( ~ is_well_founded_in(esk1_0,relation_field(esk1_0))
| ~ well_founded_relation(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,negated_conjecture,
well_founded_relation(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_35,plain,
( is_well_founded_in(X1,X2)
| ~ subset(esk3_2(X1,X2),relation_field(X1))
| ~ well_founded_relation(X1)
| ~ relation(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]) ).
cnf(c_0_36,plain,
( is_well_founded_in(X1,X2)
| subset(esk3_2(X1,X2),X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_37,negated_conjecture,
~ is_well_founded_in(esk1_0,relation_field(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_38,plain,
( is_well_founded_in(X1,relation_field(X1))
| ~ well_founded_relation(X1)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_34]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU243+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n015.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 20:28:00 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.24/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.43 # Preprocessing time : 0.017 s
% 0.24/1.43
% 0.24/1.43 # Proof found!
% 0.24/1.43 # SZS status Theorem
% 0.24/1.43 # SZS output start CNFRefutation
% See solution above
% 0.24/1.43 # Proof object total steps : 40
% 0.24/1.43 # Proof object clause steps : 29
% 0.24/1.43 # Proof object formula steps : 11
% 0.24/1.43 # Proof object conjectures : 9
% 0.24/1.43 # Proof object clause conjectures : 6
% 0.24/1.43 # Proof object formula conjectures : 3
% 0.24/1.43 # Proof object initial clauses used : 15
% 0.24/1.43 # Proof object initial formulas used : 5
% 0.24/1.43 # Proof object generating inferences : 7
% 0.24/1.43 # Proof object simplifying inferences : 17
% 0.24/1.43 # Training examples: 0 positive, 0 negative
% 0.24/1.43 # Parsed axioms : 37
% 0.24/1.43 # Removed by relevancy pruning/SinE : 14
% 0.24/1.43 # Initial clauses : 34
% 0.24/1.43 # Removed in clause preprocessing : 0
% 0.24/1.43 # Initial clauses in saturation : 34
% 0.24/1.43 # Processed clauses : 197
% 0.24/1.43 # ...of these trivial : 1
% 0.24/1.43 # ...subsumed : 85
% 0.24/1.43 # ...remaining for further processing : 111
% 0.24/1.43 # Other redundant clauses eliminated : 0
% 0.24/1.43 # Clauses deleted for lack of memory : 0
% 0.24/1.43 # Backward-subsumed : 4
% 0.24/1.43 # Backward-rewritten : 14
% 0.24/1.43 # Generated clauses : 301
% 0.24/1.43 # ...of the previous two non-trivial : 259
% 0.24/1.43 # Contextual simplify-reflections : 79
% 0.24/1.43 # Paramodulations : 301
% 0.24/1.43 # Factorizations : 0
% 0.24/1.43 # Equation resolutions : 0
% 0.24/1.43 # Current number of processed clauses : 93
% 0.24/1.43 # Positive orientable unit clauses : 12
% 0.24/1.43 # Positive unorientable unit clauses: 1
% 0.24/1.43 # Negative unit clauses : 4
% 0.24/1.43 # Non-unit-clauses : 76
% 0.24/1.43 # Current number of unprocessed clauses: 72
% 0.24/1.43 # ...number of literals in the above : 342
% 0.24/1.43 # Current number of archived formulas : 0
% 0.24/1.43 # Current number of archived clauses : 18
% 0.24/1.43 # Clause-clause subsumption calls (NU) : 2555
% 0.24/1.43 # Rec. Clause-clause subsumption calls : 1423
% 0.24/1.43 # Non-unit clause-clause subsumptions : 162
% 0.24/1.43 # Unit Clause-clause subsumption calls : 34
% 0.24/1.43 # Rewrite failures with RHS unbound : 0
% 0.24/1.43 # BW rewrite match attempts : 13
% 0.24/1.43 # BW rewrite match successes : 10
% 0.24/1.43 # Condensation attempts : 0
% 0.24/1.43 # Condensation successes : 0
% 0.24/1.43 # Termbank termtop insertions : 5995
% 0.24/1.43
% 0.24/1.43 # -------------------------------------------------
% 0.24/1.43 # User time : 0.028 s
% 0.24/1.43 # System time : 0.001 s
% 0.24/1.43 # Total time : 0.029 s
% 0.24/1.43 # Maximum resident set size: 3268 pages
%------------------------------------------------------------------------------