TSTP Solution File: SYN328+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN328+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art02.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:14:38 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 1
% Syntax : Number of formulae : 31 ( 6 unt; 0 def)
% Number of atoms : 175 ( 0 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 219 ( 75 ~; 80 |; 44 &)
% ( 6 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 36 ( 5 sgn 8 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
? [X1] :
! [X2,X3] :
( ( ( big_f(X2)
=> big_g(X2) )
<=> big_f(X1) )
=> ( ( ( big_f(X2)
=> big_h(X2) )
<=> big_g(X1) )
=> ( ( ( ( big_f(X2)
=> big_g(X2) )
=> big_h(X2) )
<=> big_h(X1) )
=> ( big_f(X3)
& big_g(X3)
& big_h(X3) ) ) ) ),
file('/tmp/tmpF28a8D/sel_SYN328+1.p_1',church_46_12_3) ).
fof(2,negated_conjecture,
~ ? [X1] :
! [X2,X3] :
( ( ( big_f(X2)
=> big_g(X2) )
<=> big_f(X1) )
=> ( ( ( big_f(X2)
=> big_h(X2) )
<=> big_g(X1) )
=> ( ( ( ( big_f(X2)
=> big_g(X2) )
=> big_h(X2) )
<=> big_h(X1) )
=> ( big_f(X3)
& big_g(X3)
& big_h(X3) ) ) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
! [X1] :
? [X2,X3] :
( ( ( big_f(X2)
& ~ big_g(X2) )
| big_f(X1) )
& ( ~ big_f(X1)
| ~ big_f(X2)
| big_g(X2) )
& ( ( big_f(X2)
& ~ big_h(X2) )
| big_g(X1) )
& ( ~ big_g(X1)
| ~ big_f(X2)
| big_h(X2) )
& ( ( ( ~ big_f(X2)
| big_g(X2) )
& ~ big_h(X2) )
| big_h(X1) )
& ( ~ big_h(X1)
| ( big_f(X2)
& ~ big_g(X2) )
| big_h(X2) )
& ( ~ big_f(X3)
| ~ big_g(X3)
| ~ big_h(X3) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
! [X4] :
? [X5,X6] :
( ( ( big_f(X5)
& ~ big_g(X5) )
| big_f(X4) )
& ( ~ big_f(X4)
| ~ big_f(X5)
| big_g(X5) )
& ( ( big_f(X5)
& ~ big_h(X5) )
| big_g(X4) )
& ( ~ big_g(X4)
| ~ big_f(X5)
| big_h(X5) )
& ( ( ( ~ big_f(X5)
| big_g(X5) )
& ~ big_h(X5) )
| big_h(X4) )
& ( ~ big_h(X4)
| ( big_f(X5)
& ~ big_g(X5) )
| big_h(X5) )
& ( ~ big_f(X6)
| ~ big_g(X6)
| ~ big_h(X6) ) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
! [X4] :
( ( ( big_f(esk1_1(X4))
& ~ big_g(esk1_1(X4)) )
| big_f(X4) )
& ( ~ big_f(X4)
| ~ big_f(esk1_1(X4))
| big_g(esk1_1(X4)) )
& ( ( big_f(esk1_1(X4))
& ~ big_h(esk1_1(X4)) )
| big_g(X4) )
& ( ~ big_g(X4)
| ~ big_f(esk1_1(X4))
| big_h(esk1_1(X4)) )
& ( ( ( ~ big_f(esk1_1(X4))
| big_g(esk1_1(X4)) )
& ~ big_h(esk1_1(X4)) )
| big_h(X4) )
& ( ~ big_h(X4)
| ( big_f(esk1_1(X4))
& ~ big_g(esk1_1(X4)) )
| big_h(esk1_1(X4)) )
& ( ~ big_f(esk2_1(X4))
| ~ big_g(esk2_1(X4))
| ~ big_h(esk2_1(X4)) ) ),
inference(skolemize,[status(esa)],[4]) ).
fof(6,negated_conjecture,
! [X4] :
( ( big_f(esk1_1(X4))
| big_f(X4) )
& ( ~ big_g(esk1_1(X4))
| big_f(X4) )
& ( ~ big_f(X4)
| ~ big_f(esk1_1(X4))
| big_g(esk1_1(X4)) )
& ( big_f(esk1_1(X4))
| big_g(X4) )
& ( ~ big_h(esk1_1(X4))
| big_g(X4) )
& ( ~ big_g(X4)
| ~ big_f(esk1_1(X4))
| big_h(esk1_1(X4)) )
& ( ~ big_f(esk1_1(X4))
| big_g(esk1_1(X4))
| big_h(X4) )
& ( ~ big_h(esk1_1(X4))
| big_h(X4) )
& ( big_f(esk1_1(X4))
| big_h(esk1_1(X4))
| ~ big_h(X4) )
& ( ~ big_g(esk1_1(X4))
| big_h(esk1_1(X4))
| ~ big_h(X4) )
& ( ~ big_f(esk2_1(X4))
| ~ big_g(esk2_1(X4))
| ~ big_h(esk2_1(X4)) ) ),
inference(distribute,[status(thm)],[5]) ).
cnf(7,negated_conjecture,
( ~ big_h(esk2_1(X1))
| ~ big_g(esk2_1(X1))
| ~ big_f(esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(10,negated_conjecture,
( big_h(X1)
| ~ big_h(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(11,negated_conjecture,
( big_h(X1)
| big_g(esk1_1(X1))
| ~ big_f(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(12,negated_conjecture,
( big_h(esk1_1(X1))
| ~ big_f(esk1_1(X1))
| ~ big_g(X1) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(13,negated_conjecture,
( big_g(X1)
| ~ big_h(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(16,negated_conjecture,
( big_f(X1)
| ~ big_g(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(17,negated_conjecture,
( big_f(X1)
| big_f(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[6]) ).
cnf(19,negated_conjecture,
( big_f(X1)
| ~ big_h(esk1_1(esk1_1(X1))) ),
inference(spm,[status(thm)],[16,13,theory(equality)]) ).
cnf(21,negated_conjecture,
( big_f(X1)
| big_h(X1)
| ~ big_f(esk1_1(X1)) ),
inference(spm,[status(thm)],[16,11,theory(equality)]) ).
cnf(25,negated_conjecture,
( big_h(esk1_1(esk1_1(X1)))
| big_h(X1)
| ~ big_f(esk1_1(esk1_1(X1)))
| ~ big_f(esk1_1(X1)) ),
inference(spm,[status(thm)],[12,11,theory(equality)]) ).
cnf(32,negated_conjecture,
( ~ big_h(esk2_1(X1))
| ~ big_f(esk2_1(X1))
| ~ big_h(esk1_1(esk2_1(X1))) ),
inference(spm,[status(thm)],[7,13,theory(equality)]) ).
cnf(34,negated_conjecture,
( ~ big_h(esk1_1(esk2_1(X1)))
| ~ big_f(esk2_1(X1)) ),
inference(csr,[status(thm)],[32,10]) ).
cnf(37,negated_conjecture,
( big_h(X1)
| big_f(X1) ),
inference(csr,[status(thm)],[21,17]) ).
cnf(38,negated_conjecture,
( big_h(X1)
| big_f(esk1_1(X1)) ),
inference(spm,[status(thm)],[10,37,theory(equality)]) ).
cnf(41,negated_conjecture,
( big_h(esk1_1(esk1_1(X1)))
| big_h(X1)
| ~ big_f(esk1_1(esk1_1(X1))) ),
inference(csr,[status(thm)],[25,38]) ).
cnf(42,negated_conjecture,
( big_h(esk1_1(esk1_1(X1)))
| big_h(X1) ),
inference(csr,[status(thm)],[41,37]) ).
cnf(43,negated_conjecture,
( big_h(esk1_1(X1))
| big_h(X1) ),
inference(spm,[status(thm)],[10,42,theory(equality)]) ).
cnf(47,negated_conjecture,
big_h(X1),
inference(csr,[status(thm)],[43,10]) ).
cnf(53,negated_conjecture,
( big_f(X1)
| $false ),
inference(rw,[status(thm)],[19,47,theory(equality)]) ).
cnf(54,negated_conjecture,
big_f(X1),
inference(cn,[status(thm)],[53,theory(equality)]) ).
cnf(55,negated_conjecture,
( $false
| ~ big_f(esk2_1(X1)) ),
inference(rw,[status(thm)],[34,47,theory(equality)]) ).
cnf(56,negated_conjecture,
~ big_f(esk2_1(X1)),
inference(cn,[status(thm)],[55,theory(equality)]) ).
cnf(70,negated_conjecture,
$false,
inference(rw,[status(thm)],[56,54,theory(equality)]) ).
cnf(71,negated_conjecture,
$false,
inference(cn,[status(thm)],[70,theory(equality)]) ).
cnf(72,negated_conjecture,
$false,
71,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN328+1.p
% --creating new selector for []
% -running prover on /tmp/tmpF28a8D/sel_SYN328+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN328+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN328+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN328+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
%
%------------------------------------------------------------------------------