TSTP Solution File: SYN333+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN333+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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:15:00 EST 2010
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 13 ( 2 unt; 0 def)
% Number of atoms : 64 ( 0 equ)
% Maximal formula atoms : 11 ( 4 avg)
% Number of connectives : 80 ( 29 ~; 27 |; 20 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 26 ( 4 sgn 10 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
? [X1,X2] :
! [X3] :
( big_f(X1,X2)
=> ( big_f(X2,X3)
& big_f(X3,X3)
& ( ( big_f(X1,X2)
& big_g(X1,X2) )
=> ( big_g(X1,X3)
& big_g(X3,X3) ) ) ) ),
file('/tmp/tmp76uG8T/sel_SYN333+1.p_1',church_46_14_5) ).
fof(2,negated_conjecture,
~ ? [X1,X2] :
! [X3] :
( big_f(X1,X2)
=> ( big_f(X2,X3)
& big_f(X3,X3)
& ( ( big_f(X1,X2)
& big_g(X1,X2) )
=> ( big_g(X1,X3)
& big_g(X3,X3) ) ) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
! [X1,X2] :
? [X3] :
( big_f(X1,X2)
& ( ~ big_f(X2,X3)
| ~ big_f(X3,X3)
| ( big_f(X1,X2)
& big_g(X1,X2)
& ( ~ big_g(X1,X3)
| ~ big_g(X3,X3) ) ) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
! [X4,X5] :
? [X6] :
( big_f(X4,X5)
& ( ~ big_f(X5,X6)
| ~ big_f(X6,X6)
| ( big_f(X4,X5)
& big_g(X4,X5)
& ( ~ big_g(X4,X6)
| ~ big_g(X6,X6) ) ) ) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
! [X4,X5] :
( big_f(X4,X5)
& ( ~ big_f(X5,esk1_2(X4,X5))
| ~ big_f(esk1_2(X4,X5),esk1_2(X4,X5))
| ( big_f(X4,X5)
& big_g(X4,X5)
& ( ~ big_g(X4,esk1_2(X4,X5))
| ~ big_g(esk1_2(X4,X5),esk1_2(X4,X5)) ) ) ) ),
inference(skolemize,[status(esa)],[4]) ).
fof(6,negated_conjecture,
! [X4,X5] :
( big_f(X4,X5)
& ( big_f(X4,X5)
| ~ big_f(X5,esk1_2(X4,X5))
| ~ big_f(esk1_2(X4,X5),esk1_2(X4,X5)) )
& ( big_g(X4,X5)
| ~ big_f(X5,esk1_2(X4,X5))
| ~ big_f(esk1_2(X4,X5),esk1_2(X4,X5)) )
& ( ~ big_g(X4,esk1_2(X4,X5))
| ~ big_g(esk1_2(X4,X5),esk1_2(X4,X5))
| ~ big_f(X5,esk1_2(X4,X5))
| ~ big_f(esk1_2(X4,X5),esk1_2(X4,X5)) ) ),
inference(distribute,[status(thm)],[5]) ).
cnf(7,negated_conjecture,
( ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2))
| ~ big_f(X2,esk1_2(X1,X2))
| ~ big_g(esk1_2(X1,X2),esk1_2(X1,X2))
| ~ big_g(X1,esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
( big_g(X1,X2)
| ~ big_f(esk1_2(X1,X2),esk1_2(X1,X2))
| ~ big_f(X2,esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(10,negated_conjecture,
big_f(X1,X2),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(12,negated_conjecture,
( big_g(X1,X2)
| $false
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[8,10,theory(equality)]),10,theory(equality)]),
[unfolding] ).
cnf(13,negated_conjecture,
( $false
| ~ big_g(X1,esk1_2(X1,X2))
| $false
| ~ big_g(esk1_2(X1,X2),esk1_2(X1,X2)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[7,10,theory(equality)]),10,theory(equality)]),
[unfolding] ).
cnf(14,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[13,12,theory(equality)]),12,theory(equality)]),
[unfolding] ).
cnf(15,negated_conjecture,
$false,
14,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN333+1.p
% --creating new selector for []
% -running prover on /tmp/tmp76uG8T/sel_SYN333+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN333+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN333+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN333+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
%
%------------------------------------------------------------------------------