TSTP Solution File: SYN068+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN068+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art09.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:07 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 29 ( 7 unt; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 82 ( 34 ~; 19 |; 26 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 31 ( 0 sgn 13 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] :
( big_f(X1)
=> ( ? [X2] :
( big_g(X2)
& big_h(X1,X2) )
& ? [X3] :
( big_g(X3)
& ~ big_h(X1,X3) ) ) ),
file('/tmp/tmpCdxklJ/sel_SYN068+1.p_1',pel44_1) ).
fof(2,conjecture,
? [X1] :
( big_j(X1)
& ~ big_f(X1) ),
file('/tmp/tmpCdxklJ/sel_SYN068+1.p_1',pel44) ).
fof(3,axiom,
? [X1] :
( big_j(X1)
& ! [X2] :
( big_g(X2)
=> big_h(X1,X2) ) ),
file('/tmp/tmpCdxklJ/sel_SYN068+1.p_1',pel44_2) ).
fof(4,negated_conjecture,
~ ? [X1] :
( big_j(X1)
& ~ big_f(X1) ),
inference(assume_negation,[status(cth)],[2]) ).
fof(5,plain,
! [X1] :
( big_f(X1)
=> ( ? [X2] :
( big_g(X2)
& big_h(X1,X2) )
& ? [X3] :
( big_g(X3)
& ~ big_h(X1,X3) ) ) ),
inference(fof_simplification,[status(thm)],[1,theory(equality)]) ).
fof(6,negated_conjecture,
~ ? [X1] :
( big_j(X1)
& ~ big_f(X1) ),
inference(fof_simplification,[status(thm)],[4,theory(equality)]) ).
fof(7,plain,
! [X1] :
( ~ big_f(X1)
| ( ? [X2] :
( big_g(X2)
& big_h(X1,X2) )
& ? [X3] :
( big_g(X3)
& ~ big_h(X1,X3) ) ) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(8,plain,
! [X4] :
( ~ big_f(X4)
| ( ? [X5] :
( big_g(X5)
& big_h(X4,X5) )
& ? [X6] :
( big_g(X6)
& ~ big_h(X4,X6) ) ) ),
inference(variable_rename,[status(thm)],[7]) ).
fof(9,plain,
! [X4] :
( ~ big_f(X4)
| ( big_g(esk1_1(X4))
& big_h(X4,esk1_1(X4))
& big_g(esk2_1(X4))
& ~ big_h(X4,esk2_1(X4)) ) ),
inference(skolemize,[status(esa)],[8]) ).
fof(10,plain,
! [X4] :
( ( big_g(esk1_1(X4))
| ~ big_f(X4) )
& ( big_h(X4,esk1_1(X4))
| ~ big_f(X4) )
& ( big_g(esk2_1(X4))
| ~ big_f(X4) )
& ( ~ big_h(X4,esk2_1(X4))
| ~ big_f(X4) ) ),
inference(distribute,[status(thm)],[9]) ).
cnf(11,plain,
( ~ big_f(X1)
| ~ big_h(X1,esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[10]) ).
cnf(12,plain,
( big_g(esk2_1(X1))
| ~ big_f(X1) ),
inference(split_conjunct,[status(thm)],[10]) ).
fof(15,negated_conjecture,
! [X1] :
( ~ big_j(X1)
| big_f(X1) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(16,negated_conjecture,
! [X2] :
( ~ big_j(X2)
| big_f(X2) ),
inference(variable_rename,[status(thm)],[15]) ).
cnf(17,negated_conjecture,
( big_f(X1)
| ~ big_j(X1) ),
inference(split_conjunct,[status(thm)],[16]) ).
fof(18,plain,
? [X1] :
( big_j(X1)
& ! [X2] :
( ~ big_g(X2)
| big_h(X1,X2) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(19,plain,
? [X3] :
( big_j(X3)
& ! [X4] :
( ~ big_g(X4)
| big_h(X3,X4) ) ),
inference(variable_rename,[status(thm)],[18]) ).
fof(20,plain,
( big_j(esk3_0)
& ! [X4] :
( ~ big_g(X4)
| big_h(esk3_0,X4) ) ),
inference(skolemize,[status(esa)],[19]) ).
fof(21,plain,
! [X4] :
( ( ~ big_g(X4)
| big_h(esk3_0,X4) )
& big_j(esk3_0) ),
inference(shift_quantors,[status(thm)],[20]) ).
cnf(22,plain,
big_j(esk3_0),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(23,plain,
( big_h(esk3_0,X1)
| ~ big_g(X1) ),
inference(split_conjunct,[status(thm)],[21]) ).
cnf(24,negated_conjecture,
big_f(esk3_0),
inference(spm,[status(thm)],[17,22,theory(equality)]) ).
cnf(25,plain,
( ~ big_f(esk3_0)
| ~ big_g(esk2_1(esk3_0)) ),
inference(spm,[status(thm)],[11,23,theory(equality)]) ).
cnf(26,plain,
( $false
| ~ big_g(esk2_1(esk3_0)) ),
inference(rw,[status(thm)],[25,24,theory(equality)]) ).
cnf(27,plain,
~ big_g(esk2_1(esk3_0)),
inference(cn,[status(thm)],[26,theory(equality)]) ).
cnf(28,plain,
~ big_f(esk3_0),
inference(spm,[status(thm)],[27,12,theory(equality)]) ).
cnf(29,plain,
$false,
inference(rw,[status(thm)],[28,24,theory(equality)]) ).
cnf(30,plain,
$false,
inference(cn,[status(thm)],[29,theory(equality)]) ).
cnf(31,plain,
$false,
30,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN068+1.p
% --creating new selector for []
% -running prover on /tmp/tmpCdxklJ/sel_SYN068+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN068+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN068+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN068+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
%
%------------------------------------------------------------------------------