TSTP Solution File: NUM410+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM410+1 : TPTP v7.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n059.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.625MB
% OS : Linux 3.10.0-693.2.2.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Jan 8 15:21:15 EST 2018
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 10 unt; 0 def)
% Number of atoms : 117 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 140 ( 56 ~; 56 |; 20 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 25 ( 2 sgn 18 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(12,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox2/tmp/tmpw6zSS9/sel_theBenchmark.p_1',reflexivity_r1_tarski) ).
fof(31,conjecture,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( ordinal(relation_dom(X1))
=> transfinite_sequence_of(X1,relation_rng(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmpw6zSS9/sel_theBenchmark.p_1',t46_ordinal1) ).
fof(33,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2)
& transfinite_sequence(X2) )
=> ( transfinite_sequence_of(X2,X1)
<=> subset(relation_rng(X2),X1) ) ),
file('/export/starexec/sandbox2/tmp/tmpw6zSS9/sel_theBenchmark.p_1',d8_ordinal1) ).
fof(38,axiom,
! [X1] :
( ( relation(X1)
& function(X1) )
=> ( transfinite_sequence(X1)
<=> ordinal(relation_dom(X1)) ) ),
file('/export/starexec/sandbox2/tmp/tmpw6zSS9/sel_theBenchmark.p_1',d7_ordinal1) ).
fof(46,negated_conjecture,
~ ! [X1] :
( ( relation(X1)
& function(X1) )
=> ( ordinal(relation_dom(X1))
=> transfinite_sequence_of(X1,relation_rng(X1)) ) ),
inference(assume_negation,[status(cth)],[31]) ).
fof(105,plain,
! [X3,X4] : subset(X3,X3),
inference(variable_rename,[status(thm)],[12]) ).
cnf(106,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[105]) ).
fof(174,negated_conjecture,
? [X1] :
( relation(X1)
& function(X1)
& ordinal(relation_dom(X1))
& ~ transfinite_sequence_of(X1,relation_rng(X1)) ),
inference(fof_nnf,[status(thm)],[46]) ).
fof(175,negated_conjecture,
? [X2] :
( relation(X2)
& function(X2)
& ordinal(relation_dom(X2))
& ~ transfinite_sequence_of(X2,relation_rng(X2)) ),
inference(variable_rename,[status(thm)],[174]) ).
fof(176,negated_conjecture,
( relation(esk9_0)
& function(esk9_0)
& ordinal(relation_dom(esk9_0))
& ~ transfinite_sequence_of(esk9_0,relation_rng(esk9_0)) ),
inference(skolemize,[status(esa)],[175]) ).
cnf(177,negated_conjecture,
~ transfinite_sequence_of(esk9_0,relation_rng(esk9_0)),
inference(split_conjunct,[status(thm)],[176]) ).
cnf(178,negated_conjecture,
ordinal(relation_dom(esk9_0)),
inference(split_conjunct,[status(thm)],[176]) ).
cnf(179,negated_conjecture,
function(esk9_0),
inference(split_conjunct,[status(thm)],[176]) ).
cnf(180,negated_conjecture,
relation(esk9_0),
inference(split_conjunct,[status(thm)],[176]) ).
fof(186,plain,
! [X1,X2] :
( ~ relation(X2)
| ~ function(X2)
| ~ transfinite_sequence(X2)
| ( ( ~ transfinite_sequence_of(X2,X1)
| subset(relation_rng(X2),X1) )
& ( ~ subset(relation_rng(X2),X1)
| transfinite_sequence_of(X2,X1) ) ) ),
inference(fof_nnf,[status(thm)],[33]) ).
fof(187,plain,
! [X3,X4] :
( ~ relation(X4)
| ~ function(X4)
| ~ transfinite_sequence(X4)
| ( ( ~ transfinite_sequence_of(X4,X3)
| subset(relation_rng(X4),X3) )
& ( ~ subset(relation_rng(X4),X3)
| transfinite_sequence_of(X4,X3) ) ) ),
inference(variable_rename,[status(thm)],[186]) ).
fof(188,plain,
! [X3,X4] :
( ( ~ transfinite_sequence_of(X4,X3)
| subset(relation_rng(X4),X3)
| ~ relation(X4)
| ~ function(X4)
| ~ transfinite_sequence(X4) )
& ( ~ subset(relation_rng(X4),X3)
| transfinite_sequence_of(X4,X3)
| ~ relation(X4)
| ~ function(X4)
| ~ transfinite_sequence(X4) ) ),
inference(distribute,[status(thm)],[187]) ).
cnf(189,plain,
( transfinite_sequence_of(X1,X2)
| ~ transfinite_sequence(X1)
| ~ function(X1)
| ~ relation(X1)
| ~ subset(relation_rng(X1),X2) ),
inference(split_conjunct,[status(thm)],[188]) ).
fof(204,plain,
! [X1] :
( ~ relation(X1)
| ~ function(X1)
| ( ( ~ transfinite_sequence(X1)
| ordinal(relation_dom(X1)) )
& ( ~ ordinal(relation_dom(X1))
| transfinite_sequence(X1) ) ) ),
inference(fof_nnf,[status(thm)],[38]) ).
fof(205,plain,
! [X2] :
( ~ relation(X2)
| ~ function(X2)
| ( ( ~ transfinite_sequence(X2)
| ordinal(relation_dom(X2)) )
& ( ~ ordinal(relation_dom(X2))
| transfinite_sequence(X2) ) ) ),
inference(variable_rename,[status(thm)],[204]) ).
fof(206,plain,
! [X2] :
( ( ~ transfinite_sequence(X2)
| ordinal(relation_dom(X2))
| ~ relation(X2)
| ~ function(X2) )
& ( ~ ordinal(relation_dom(X2))
| transfinite_sequence(X2)
| ~ relation(X2)
| ~ function(X2) ) ),
inference(distribute,[status(thm)],[205]) ).
cnf(207,plain,
( transfinite_sequence(X1)
| ~ function(X1)
| ~ relation(X1)
| ~ ordinal(relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[206]) ).
cnf(253,negated_conjecture,
( transfinite_sequence(esk9_0)
| ~ function(esk9_0)
| ~ relation(esk9_0) ),
inference(spm,[status(thm)],[207,178,theory(equality)]) ).
cnf(256,negated_conjecture,
( transfinite_sequence(esk9_0)
| $false
| ~ relation(esk9_0) ),
inference(rw,[status(thm)],[253,179,theory(equality)]) ).
cnf(257,negated_conjecture,
( transfinite_sequence(esk9_0)
| $false
| $false ),
inference(rw,[status(thm)],[256,180,theory(equality)]) ).
cnf(258,negated_conjecture,
transfinite_sequence(esk9_0),
inference(cn,[status(thm)],[257,theory(equality)]) ).
cnf(298,plain,
( transfinite_sequence_of(X1,relation_rng(X1))
| ~ transfinite_sequence(X1)
| ~ function(X1)
| ~ relation(X1) ),
inference(spm,[status(thm)],[189,106,theory(equality)]) ).
cnf(465,negated_conjecture,
( ~ transfinite_sequence(esk9_0)
| ~ function(esk9_0)
| ~ relation(esk9_0) ),
inference(spm,[status(thm)],[177,298,theory(equality)]) ).
cnf(477,negated_conjecture,
( $false
| ~ function(esk9_0)
| ~ relation(esk9_0) ),
inference(rw,[status(thm)],[465,258,theory(equality)]) ).
cnf(478,negated_conjecture,
( $false
| $false
| ~ relation(esk9_0) ),
inference(rw,[status(thm)],[477,179,theory(equality)]) ).
cnf(479,negated_conjecture,
( $false
| $false
| $false ),
inference(rw,[status(thm)],[478,180,theory(equality)]) ).
cnf(480,negated_conjecture,
$false,
inference(cn,[status(thm)],[479,theory(equality)]) ).
cnf(481,negated_conjecture,
$false,
480,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM410+1 : TPTP v7.0.0. Released v3.2.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n059.star.cs.uiowa.edu
% 0.02/0.23 % Model : x86_64 x86_64
% 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23 % Memory : 32218.625MB
% 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Fri Jan 5 03:45:15 CST 2018
% 0.02/0.23 % CPUTime :
% 0.07/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.28 --creating new selector for []
% 0.07/0.36 -running prover on /export/starexec/sandbox2/tmp/tmpw6zSS9/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.36 -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox2/tmp/tmpw6zSS9/sel_theBenchmark.p_1']
% 0.07/0.36 -prover status Theorem
% 0.07/0.36 Problem theBenchmark.p solved in phase 0.
% 0.07/0.36 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.36 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.36 Solved 1 out of 1.
% 0.07/0.36 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.36 # SZS status Theorem
% 0.07/0.36 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.37 # SZS output end CNFRefutation
%------------------------------------------------------------------------------