TSTP Solution File: KRS066+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KRS066+1 : TPTP v5.0.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art04.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 : Sat Dec 25 12:56:38 EST 2010
% Result : Unsatisfiable 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 4 unt; 0 def)
% Number of atoms : 24 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 21 ( 9 ~; 6 |; 5 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 10 ( 3 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( cowlThing(X1)
<=> cowlNothing(X1) ),
file('/tmp/tmpoIuyVO/sel_KRS066+1.p_1',axiom_2) ).
fof(2,axiom,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
file('/tmp/tmpoIuyVO/sel_KRS066+1.p_1',axiom_0) ).
fof(4,plain,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(6,plain,
! [X1] :
( ( ~ cowlThing(X1)
| cowlNothing(X1) )
& ( ~ cowlNothing(X1)
| cowlThing(X1) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(7,plain,
! [X2] :
( ( ~ cowlThing(X2)
| cowlNothing(X2) )
& ( ~ cowlNothing(X2)
| cowlThing(X2) ) ),
inference(variable_rename,[status(thm)],[6]) ).
cnf(9,plain,
( cowlNothing(X1)
| ~ cowlThing(X1) ),
inference(split_conjunct,[status(thm)],[7]) ).
fof(10,plain,
! [X2] :
( cowlThing(X2)
& ~ cowlNothing(X2) ),
inference(variable_rename,[status(thm)],[4]) ).
cnf(11,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(12,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(18,plain,
( cowlNothing(X1)
| $false ),
inference(rw,[status(thm)],[9,12,theory(equality)]),
[unfolding] ).
cnf(20,plain,
$false,
inference(rw,[status(thm)],[11,18,theory(equality)]),
[unfolding] ).
cnf(21,plain,
$false,
20,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KRS/KRS066+1.p
% --creating new selector for []
% -running prover on /tmp/tmpoIuyVO/sel_KRS066+1.p_1 with time limit 29
% -prover status Unsatisfiable
% Problem KRS066+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KRS/KRS066+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KRS/KRS066+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Unsatisfiable
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------