TSTP Solution File: RNG125+4 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : RNG125+4 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sun Dec 26 02:35:29 EST 2010
% Result : Theorem 0.28s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 4 unt; 0 def)
% Number of atoms : 90 ( 22 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 126 ( 56 ~; 31 |; 39 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 8 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(5,axiom,
~ ~ ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xu,X1) = xb )
& doDivides0(xu,xb) ),
file('/tmp/tmp6lBVoK/sel_RNG125+4.p_1',m__2612) ).
fof(10,axiom,
~ ( ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xu,X1) = xa )
| doDivides0(xu,xa)
| aDivisorOf0(xu,xa) )
& ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xu,X1) = xb )
| doDivides0(xu,xb)
| aDivisorOf0(xu,xb) ) ),
file('/tmp/tmp6lBVoK/sel_RNG125+4.p_1',m__2383) ).
fof(45,axiom,
~ ~ ( ? [X1] :
( aElement0(X1)
& sdtasdt0(xu,X1) = xa )
& doDivides0(xu,xa) ),
file('/tmp/tmp6lBVoK/sel_RNG125+4.p_1',m__2479) ).
fof(69,plain,
( ? [X1] :
( aElement0(X1)
& sdtasdt0(xu,X1) = xb )
& doDivides0(xu,xb) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(70,plain,
( ? [X2] :
( aElement0(X2)
& sdtasdt0(xu,X2) = xb )
& doDivides0(xu,xb) ),
inference(variable_rename,[status(thm)],[69]) ).
fof(71,plain,
( aElement0(esk1_0)
& sdtasdt0(xu,esk1_0) = xb
& doDivides0(xu,xb) ),
inference(skolemize,[status(esa)],[70]) ).
cnf(72,plain,
doDivides0(xu,xb),
inference(split_conjunct,[status(thm)],[71]) ).
fof(142,plain,
( ( ! [X1] :
( ~ aElement0(X1)
| sdtasdt0(xu,X1) != xa )
& ~ doDivides0(xu,xa)
& ~ aDivisorOf0(xu,xa) )
| ( ! [X1] :
( ~ aElement0(X1)
| sdtasdt0(xu,X1) != xb )
& ~ doDivides0(xu,xb)
& ~ aDivisorOf0(xu,xb) ) ),
inference(fof_nnf,[status(thm)],[10]) ).
fof(143,plain,
( ( ! [X2] :
( ~ aElement0(X2)
| sdtasdt0(xu,X2) != xa )
& ~ doDivides0(xu,xa)
& ~ aDivisorOf0(xu,xa) )
| ( ! [X3] :
( ~ aElement0(X3)
| sdtasdt0(xu,X3) != xb )
& ~ doDivides0(xu,xb)
& ~ aDivisorOf0(xu,xb) ) ),
inference(variable_rename,[status(thm)],[142]) ).
fof(144,plain,
! [X2,X3] :
( ( ( ~ aElement0(X3)
| sdtasdt0(xu,X3) != xb )
& ~ doDivides0(xu,xb)
& ~ aDivisorOf0(xu,xb) )
| ( ( ~ aElement0(X2)
| sdtasdt0(xu,X2) != xa )
& ~ doDivides0(xu,xa)
& ~ aDivisorOf0(xu,xa) ) ),
inference(shift_quantors,[status(thm)],[143]) ).
fof(145,plain,
! [X2,X3] :
( ( ~ aElement0(X2)
| sdtasdt0(xu,X2) != xa
| ~ aElement0(X3)
| sdtasdt0(xu,X3) != xb )
& ( ~ doDivides0(xu,xa)
| ~ aElement0(X3)
| sdtasdt0(xu,X3) != xb )
& ( ~ aDivisorOf0(xu,xa)
| ~ aElement0(X3)
| sdtasdt0(xu,X3) != xb )
& ( ~ aElement0(X2)
| sdtasdt0(xu,X2) != xa
| ~ doDivides0(xu,xb) )
& ( ~ doDivides0(xu,xa)
| ~ doDivides0(xu,xb) )
& ( ~ aDivisorOf0(xu,xa)
| ~ doDivides0(xu,xb) )
& ( ~ aElement0(X2)
| sdtasdt0(xu,X2) != xa
| ~ aDivisorOf0(xu,xb) )
& ( ~ doDivides0(xu,xa)
| ~ aDivisorOf0(xu,xb) )
& ( ~ aDivisorOf0(xu,xa)
| ~ aDivisorOf0(xu,xb) ) ),
inference(distribute,[status(thm)],[144]) ).
cnf(150,plain,
( ~ doDivides0(xu,xb)
| ~ doDivides0(xu,xa) ),
inference(split_conjunct,[status(thm)],[145]) ).
fof(360,plain,
( ? [X1] :
( aElement0(X1)
& sdtasdt0(xu,X1) = xa )
& doDivides0(xu,xa) ),
inference(fof_nnf,[status(thm)],[45]) ).
fof(361,plain,
( ? [X2] :
( aElement0(X2)
& sdtasdt0(xu,X2) = xa )
& doDivides0(xu,xa) ),
inference(variable_rename,[status(thm)],[360]) ).
fof(362,plain,
( aElement0(esk41_0)
& sdtasdt0(xu,esk41_0) = xa
& doDivides0(xu,xa) ),
inference(skolemize,[status(esa)],[361]) ).
cnf(363,plain,
doDivides0(xu,xa),
inference(split_conjunct,[status(thm)],[362]) ).
cnf(395,plain,
( $false
| ~ doDivides0(xu,xa) ),
inference(rw,[status(thm)],[150,72,theory(equality)]) ).
cnf(396,plain,
( $false
| $false ),
inference(rw,[status(thm)],[395,363,theory(equality)]) ).
cnf(397,plain,
$false,
inference(cn,[status(thm)],[396,theory(equality)]) ).
cnf(398,plain,
$false,
397,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/RNG/RNG125+4.p
% --creating new selector for []
% -running prover on /tmp/tmp6lBVoK/sel_RNG125+4.p_1 with time limit 29
% -prover status Theorem
% Problem RNG125+4.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/RNG/RNG125+4.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/RNG/RNG125+4.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------