TSTP Solution File: KRS193+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS193+1 : TPTP v5.3.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : antietam.cs.miami.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Core(TM)2 CPU 6600 @ 2.40GHz @ 2400MHz
% Memory : 1003MB
% OS : Linux 2.6.32.26-175.fc12.x86_64
% CPULimit : 300s
% DateTime : Fri Jun 15 07:48:29 EDT 2012
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 7 unt; 0 def)
% Number of atoms : 105 ( 0 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 121 ( 46 ~; 46 |; 24 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 78 ( 4 sgn 56 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( ~ ? [X3] : model(X3,X1)
<=> status(X1,X2,cax) ),
file('/tmp/tmp3mx9wo/sel_KRS193+1.p_1',cax) ).
fof(5,axiom,
! [X1,X2] :
( ! [X3] :
( model(X3,X1)
=> model(X3,X2) )
<=> status(X1,X2,thm) ),
file('/tmp/tmp3mx9wo/sel_KRS193+1.p_1',thm) ).
fof(7,axiom,
! [X7,X8] :
( ! [X1,X2] :
( status(X1,X2,X7)
=> status(X1,X2,X8) )
<=> isa(X7,X8) ),
file('/tmp/tmp3mx9wo/sel_KRS193+1.p_1',isa) ).
fof(10,conjecture,
isa(cax,thm),
file('/tmp/tmp3mx9wo/sel_KRS193+1.p_1',isa_cax_thm) ).
fof(11,negated_conjecture,
~ isa(cax,thm),
inference(assume_negation,[status(cth)],[10]) ).
fof(17,negated_conjecture,
~ isa(cax,thm),
inference(fof_simplification,[status(thm)],[11,theory(equality)]) ).
fof(18,plain,
! [X1,X2] :
( ( ? [X3] : model(X3,X1)
| status(X1,X2,cax) )
& ( ~ status(X1,X2,cax)
| ! [X3] : ~ model(X3,X1) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(19,plain,
! [X4,X5] :
( ( ? [X6] : model(X6,X4)
| status(X4,X5,cax) )
& ( ~ status(X4,X5,cax)
| ! [X7] : ~ model(X7,X4) ) ),
inference(variable_rename,[status(thm)],[18]) ).
fof(20,plain,
! [X4,X5] :
( ( model(esk1_2(X4,X5),X4)
| status(X4,X5,cax) )
& ( ~ status(X4,X5,cax)
| ! [X7] : ~ model(X7,X4) ) ),
inference(skolemize,[status(esa)],[19]) ).
fof(21,plain,
! [X4,X5,X7] :
( ( ~ model(X7,X4)
| ~ status(X4,X5,cax) )
& ( model(esk1_2(X4,X5),X4)
| status(X4,X5,cax) ) ),
inference(shift_quantors,[status(thm)],[20]) ).
cnf(23,plain,
( ~ status(X1,X2,cax)
| ~ model(X3,X1) ),
inference(split_conjunct,[status(thm)],[21]) ).
fof(35,plain,
! [X1,X2] :
( ( ? [X3] :
( model(X3,X1)
& ~ model(X3,X2) )
| status(X1,X2,thm) )
& ( ~ status(X1,X2,thm)
| ! [X3] :
( ~ model(X3,X1)
| model(X3,X2) ) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(36,plain,
! [X4,X5] :
( ( ? [X6] :
( model(X6,X4)
& ~ model(X6,X5) )
| status(X4,X5,thm) )
& ( ~ status(X4,X5,thm)
| ! [X7] :
( ~ model(X7,X4)
| model(X7,X5) ) ) ),
inference(variable_rename,[status(thm)],[35]) ).
fof(37,plain,
! [X4,X5] :
( ( ( model(esk8_2(X4,X5),X4)
& ~ model(esk8_2(X4,X5),X5) )
| status(X4,X5,thm) )
& ( ~ status(X4,X5,thm)
| ! [X7] :
( ~ model(X7,X4)
| model(X7,X5) ) ) ),
inference(skolemize,[status(esa)],[36]) ).
fof(38,plain,
! [X4,X5,X7] :
( ( ~ model(X7,X4)
| model(X7,X5)
| ~ status(X4,X5,thm) )
& ( ( model(esk8_2(X4,X5),X4)
& ~ model(esk8_2(X4,X5),X5) )
| status(X4,X5,thm) ) ),
inference(shift_quantors,[status(thm)],[37]) ).
fof(39,plain,
! [X4,X5,X7] :
( ( ~ model(X7,X4)
| model(X7,X5)
| ~ status(X4,X5,thm) )
& ( model(esk8_2(X4,X5),X4)
| status(X4,X5,thm) )
& ( ~ model(esk8_2(X4,X5),X5)
| status(X4,X5,thm) ) ),
inference(distribute,[status(thm)],[38]) ).
cnf(41,plain,
( status(X1,X2,thm)
| model(esk8_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[39]) ).
fof(48,plain,
! [X7,X8] :
( ( ? [X1,X2] :
( status(X1,X2,X7)
& ~ status(X1,X2,X8) )
| isa(X7,X8) )
& ( ~ isa(X7,X8)
| ! [X1,X2] :
( ~ status(X1,X2,X7)
| status(X1,X2,X8) ) ) ),
inference(fof_nnf,[status(thm)],[7]) ).
fof(49,plain,
! [X9,X10] :
( ( ? [X11,X12] :
( status(X11,X12,X9)
& ~ status(X11,X12,X10) )
| isa(X9,X10) )
& ( ~ isa(X9,X10)
| ! [X13,X14] :
( ~ status(X13,X14,X9)
| status(X13,X14,X10) ) ) ),
inference(variable_rename,[status(thm)],[48]) ).
fof(50,plain,
! [X9,X10] :
( ( ( status(esk13_2(X9,X10),esk14_2(X9,X10),X9)
& ~ status(esk13_2(X9,X10),esk14_2(X9,X10),X10) )
| isa(X9,X10) )
& ( ~ isa(X9,X10)
| ! [X13,X14] :
( ~ status(X13,X14,X9)
| status(X13,X14,X10) ) ) ),
inference(skolemize,[status(esa)],[49]) ).
fof(51,plain,
! [X9,X10,X13,X14] :
( ( ~ status(X13,X14,X9)
| status(X13,X14,X10)
| ~ isa(X9,X10) )
& ( ( status(esk13_2(X9,X10),esk14_2(X9,X10),X9)
& ~ status(esk13_2(X9,X10),esk14_2(X9,X10),X10) )
| isa(X9,X10) ) ),
inference(shift_quantors,[status(thm)],[50]) ).
fof(52,plain,
! [X9,X10,X13,X14] :
( ( ~ status(X13,X14,X9)
| status(X13,X14,X10)
| ~ isa(X9,X10) )
& ( status(esk13_2(X9,X10),esk14_2(X9,X10),X9)
| isa(X9,X10) )
& ( ~ status(esk13_2(X9,X10),esk14_2(X9,X10),X10)
| isa(X9,X10) ) ),
inference(distribute,[status(thm)],[51]) ).
cnf(53,plain,
( isa(X1,X2)
| ~ status(esk13_2(X1,X2),esk14_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[52]) ).
cnf(54,plain,
( isa(X1,X2)
| status(esk13_2(X1,X2),esk14_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[52]) ).
cnf(69,negated_conjecture,
~ isa(cax,thm),
inference(split_conjunct,[status(thm)],[17]) ).
cnf(76,plain,
( isa(cax,X1)
| ~ model(X2,esk13_2(cax,X1)) ),
inference(spm,[status(thm)],[23,54,theory(equality)]) ).
cnf(97,plain,
( isa(cax,X1)
| status(esk13_2(cax,X1),X2,thm) ),
inference(spm,[status(thm)],[76,41,theory(equality)]) ).
cnf(104,plain,
isa(cax,thm),
inference(spm,[status(thm)],[53,97,theory(equality)]) ).
cnf(105,plain,
$false,
inference(sr,[status(thm)],[104,69,theory(equality)]) ).
cnf(106,plain,
$false,
105,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS193+1.p
% --creating new selector for [KRS001+0.ax, KRS001+1.ax]
% -running prover on /tmp/tmp3mx9wo/sel_KRS193+1.p_1 with time limit 29
% -running prover with command ['/davis/home/graph/tptp/Systems/SInE---0.4/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/tmp/tmp3mx9wo/sel_KRS193+1.p_1']
% -prover status Theorem
% Problem KRS193+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS193+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS193+1.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
%
%------------------------------------------------------------------------------