TSTP Solution File: SYN069+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN069+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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 13:12:14 EST 2010
% Result : Theorem 0.21s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 3
% Syntax : Number of formulae : 49 ( 10 unt; 0 def)
% Number of atoms : 175 ( 0 equ)
% Maximal formula atoms : 27 ( 3 avg)
% Number of connectives : 194 ( 68 ~; 82 |; 40 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 66 ( 24 sgn 25 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1] :
( ( big_f(X1)
& ! [X2] :
( ( big_g(X2)
& big_h(X1,X2) )
=> big_j(X1,X2) ) )
=> ! [X3] :
( big_g(X3)
& big_h(X1,X3)
& big_k(X3) ) ),
file('/tmp/tmpj4t0Vx/sel_SYN069+1.p_1',pel45_1) ).
fof(3,axiom,
~ ? [X2] :
( big_l(X2)
& big_k(X2) ),
file('/tmp/tmpj4t0Vx/sel_SYN069+1.p_1',pel45_2) ).
fof(4,axiom,
? [X1] :
( big_f(X1)
& ! [X2] :
( big_h(X1,X2)
=> big_l(X2) )
& ! [X3] :
( ( big_g(X3)
& big_h(X1,X3) )
=> big_j(X1,X3) ) ),
file('/tmp/tmpj4t0Vx/sel_SYN069+1.p_1',pel45_3) ).
fof(12,plain,
! [X1] :
( ~ big_f(X1)
| ? [X2] :
( big_g(X2)
& big_h(X1,X2)
& ~ big_j(X1,X2) )
| ! [X3] :
( big_g(X3)
& big_h(X1,X3)
& big_k(X3) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(13,plain,
! [X4] :
( ~ big_f(X4)
| ? [X5] :
( big_g(X5)
& big_h(X4,X5)
& ~ big_j(X4,X5) )
| ! [X6] :
( big_g(X6)
& big_h(X4,X6)
& big_k(X6) ) ),
inference(variable_rename,[status(thm)],[12]) ).
fof(14,plain,
! [X4] :
( ~ big_f(X4)
| ( big_g(esk2_1(X4))
& big_h(X4,esk2_1(X4))
& ~ big_j(X4,esk2_1(X4)) )
| ! [X6] :
( big_g(X6)
& big_h(X4,X6)
& big_k(X6) ) ),
inference(skolemize,[status(esa)],[13]) ).
fof(15,plain,
! [X4,X6] :
( ( big_g(X6)
& big_h(X4,X6)
& big_k(X6) )
| ~ big_f(X4)
| ( big_g(esk2_1(X4))
& big_h(X4,esk2_1(X4))
& ~ big_j(X4,esk2_1(X4)) ) ),
inference(shift_quantors,[status(thm)],[14]) ).
fof(16,plain,
! [X4,X6] :
( ( big_g(esk2_1(X4))
| ~ big_f(X4)
| big_g(X6) )
& ( big_h(X4,esk2_1(X4))
| ~ big_f(X4)
| big_g(X6) )
& ( ~ big_j(X4,esk2_1(X4))
| ~ big_f(X4)
| big_g(X6) )
& ( big_g(esk2_1(X4))
| ~ big_f(X4)
| big_h(X4,X6) )
& ( big_h(X4,esk2_1(X4))
| ~ big_f(X4)
| big_h(X4,X6) )
& ( ~ big_j(X4,esk2_1(X4))
| ~ big_f(X4)
| big_h(X4,X6) )
& ( big_g(esk2_1(X4))
| ~ big_f(X4)
| big_k(X6) )
& ( big_h(X4,esk2_1(X4))
| ~ big_f(X4)
| big_k(X6) )
& ( ~ big_j(X4,esk2_1(X4))
| ~ big_f(X4)
| big_k(X6) ) ),
inference(distribute,[status(thm)],[15]) ).
cnf(17,plain,
( big_k(X1)
| ~ big_f(X2)
| ~ big_j(X2,esk2_1(X2)) ),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(20,plain,
( big_h(X1,X2)
| ~ big_f(X1)
| ~ big_j(X1,esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(21,plain,
( big_h(X1,X2)
| big_h(X1,esk2_1(X1))
| ~ big_f(X1) ),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(23,plain,
( big_g(X1)
| ~ big_f(X2)
| ~ big_j(X2,esk2_1(X2)) ),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(25,plain,
( big_g(X1)
| big_g(esk2_1(X2))
| ~ big_f(X2) ),
inference(split_conjunct,[status(thm)],[16]) ).
fof(26,plain,
! [X2] :
( ~ big_l(X2)
| ~ big_k(X2) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(27,plain,
! [X3] :
( ~ big_l(X3)
| ~ big_k(X3) ),
inference(variable_rename,[status(thm)],[26]) ).
cnf(28,plain,
( ~ big_k(X1)
| ~ big_l(X1) ),
inference(split_conjunct,[status(thm)],[27]) ).
fof(29,plain,
? [X1] :
( big_f(X1)
& ! [X2] :
( ~ big_h(X1,X2)
| big_l(X2) )
& ! [X3] :
( ~ big_g(X3)
| ~ big_h(X1,X3)
| big_j(X1,X3) ) ),
inference(fof_nnf,[status(thm)],[4]) ).
fof(30,plain,
? [X4] :
( big_f(X4)
& ! [X5] :
( ~ big_h(X4,X5)
| big_l(X5) )
& ! [X6] :
( ~ big_g(X6)
| ~ big_h(X4,X6)
| big_j(X4,X6) ) ),
inference(variable_rename,[status(thm)],[29]) ).
fof(31,plain,
( big_f(esk3_0)
& ! [X5] :
( ~ big_h(esk3_0,X5)
| big_l(X5) )
& ! [X6] :
( ~ big_g(X6)
| ~ big_h(esk3_0,X6)
| big_j(esk3_0,X6) ) ),
inference(skolemize,[status(esa)],[30]) ).
fof(32,plain,
! [X5,X6] :
( ( ~ big_g(X6)
| ~ big_h(esk3_0,X6)
| big_j(esk3_0,X6) )
& ( ~ big_h(esk3_0,X5)
| big_l(X5) )
& big_f(esk3_0) ),
inference(shift_quantors,[status(thm)],[31]) ).
cnf(33,plain,
big_f(esk3_0),
inference(split_conjunct,[status(thm)],[32]) ).
cnf(34,plain,
( big_l(X1)
| ~ big_h(esk3_0,X1) ),
inference(split_conjunct,[status(thm)],[32]) ).
cnf(35,plain,
( big_j(esk3_0,X1)
| ~ big_h(esk3_0,X1)
| ~ big_g(X1) ),
inference(split_conjunct,[status(thm)],[32]) ).
cnf(36,plain,
( big_g(esk2_1(esk3_0))
| big_g(X1) ),
inference(spm,[status(thm)],[25,33,theory(equality)]) ).
cnf(39,plain,
( ~ big_k(X1)
| ~ big_h(esk3_0,X1) ),
inference(spm,[status(thm)],[28,34,theory(equality)]) ).
cnf(41,plain,
( big_h(esk3_0,esk2_1(esk3_0))
| big_h(esk3_0,X1) ),
inference(spm,[status(thm)],[21,33,theory(equality)]) ).
cnf(43,plain,
( big_g(X1)
| ~ big_f(esk3_0)
| ~ big_h(esk3_0,esk2_1(esk3_0))
| ~ big_g(esk2_1(esk3_0)) ),
inference(spm,[status(thm)],[23,35,theory(equality)]) ).
cnf(44,plain,
( big_g(X1)
| $false
| ~ big_h(esk3_0,esk2_1(esk3_0))
| ~ big_g(esk2_1(esk3_0)) ),
inference(rw,[status(thm)],[43,33,theory(equality)]) ).
cnf(45,plain,
( big_g(X1)
| ~ big_h(esk3_0,esk2_1(esk3_0))
| ~ big_g(esk2_1(esk3_0)) ),
inference(cn,[status(thm)],[44,theory(equality)]) ).
cnf(52,plain,
big_g(esk2_1(esk3_0)),
inference(ef,[status(thm)],[36,theory(equality)]) ).
cnf(58,plain,
big_h(esk3_0,esk2_1(esk3_0)),
inference(ef,[status(thm)],[41,theory(equality)]) ).
cnf(63,plain,
( big_g(X1)
| $false
| ~ big_g(esk2_1(esk3_0)) ),
inference(rw,[status(thm)],[45,58,theory(equality)]) ).
cnf(64,plain,
( big_g(X1)
| $false
| $false ),
inference(rw,[status(thm)],[63,52,theory(equality)]) ).
cnf(65,plain,
big_g(X1),
inference(cn,[status(thm)],[64,theory(equality)]) ).
cnf(67,plain,
( big_j(esk3_0,X1)
| ~ big_h(esk3_0,X1)
| $false ),
inference(rw,[status(thm)],[35,65,theory(equality)]) ).
cnf(68,plain,
( big_j(esk3_0,X1)
| ~ big_h(esk3_0,X1) ),
inference(cn,[status(thm)],[67,theory(equality)]) ).
cnf(77,plain,
( big_h(esk3_0,X1)
| ~ big_f(esk3_0)
| ~ big_h(esk3_0,esk2_1(esk3_0)) ),
inference(spm,[status(thm)],[20,68,theory(equality)]) ).
cnf(79,plain,
( big_h(esk3_0,X1)
| $false
| ~ big_h(esk3_0,esk2_1(esk3_0)) ),
inference(rw,[status(thm)],[77,33,theory(equality)]) ).
cnf(80,plain,
( big_h(esk3_0,X1)
| $false
| $false ),
inference(rw,[status(thm)],[79,58,theory(equality)]) ).
cnf(81,plain,
big_h(esk3_0,X1),
inference(cn,[status(thm)],[80,theory(equality)]) ).
cnf(86,plain,
( big_j(esk3_0,X1)
| $false ),
inference(rw,[status(thm)],[68,81,theory(equality)]) ).
cnf(87,plain,
big_j(esk3_0,X1),
inference(cn,[status(thm)],[86,theory(equality)]) ).
cnf(88,plain,
( ~ big_k(X1)
| $false ),
inference(rw,[status(thm)],[39,81,theory(equality)]) ).
cnf(89,plain,
~ big_k(X1),
inference(cn,[status(thm)],[88,theory(equality)]) ).
cnf(95,plain,
( big_k(X1)
| ~ big_f(esk3_0) ),
inference(spm,[status(thm)],[17,87,theory(equality)]) ).
cnf(99,plain,
( big_k(X1)
| $false ),
inference(rw,[status(thm)],[95,33,theory(equality)]) ).
cnf(100,plain,
big_k(X1),
inference(cn,[status(thm)],[99,theory(equality)]) ).
cnf(101,plain,
$false,
inference(sr,[status(thm)],[100,89,theory(equality)]) ).
cnf(102,plain,
$false,
101,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN069+1.p
% --creating new selector for []
% -running prover on /tmp/tmpj4t0Vx/sel_SYN069+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN069+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN069+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN069+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
%
%------------------------------------------------------------------------------