TSTP Solution File: SYN319+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN319+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:13:58 EST 2010
% Result : Theorem 0.23s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 1
% Syntax : Number of formulae : 18 ( 6 unt; 0 def)
% Number of atoms : 107 ( 0 equ)
% Maximal formula atoms : 19 ( 5 avg)
% Number of connectives : 127 ( 38 ~; 33 |; 35 &)
% ( 0 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 0 con; 2-2 aty)
% Number of variables : 35 ( 7 sgn 14 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
? [X1,X2] :
! [X3,X4] :
( ( ( big_f(X2)
=> big_g(X3) )
=> ( big_g(X1)
& ~ big_f(X3) ) )
=> ( ( ( big_f(X1)
| big_g(X1) )
=> big_h(X1) )
=> ( big_h(X4)
& ( big_h(X2)
=> ( ( big_f(X4)
| big_g(X4) )
=> big_h(X4) ) ) ) ) ),
file('/tmp/tmpWkwrXM/sel_SYN319+1.p_1',church_46_2_5) ).
fof(2,negated_conjecture,
~ ? [X1,X2] :
! [X3,X4] :
( ( ( big_f(X2)
=> big_g(X3) )
=> ( big_g(X1)
& ~ big_f(X3) ) )
=> ( ( ( big_f(X1)
| big_g(X1) )
=> big_h(X1) )
=> ( big_h(X4)
& ( big_h(X2)
=> ( ( big_f(X4)
| big_g(X4) )
=> big_h(X4) ) ) ) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
~ ? [X1,X2] :
! [X3,X4] :
( ( ( big_f(X2)
=> big_g(X3) )
=> ( big_g(X1)
& ~ big_f(X3) ) )
=> ( ( ( big_f(X1)
| big_g(X1) )
=> big_h(X1) )
=> ( big_h(X4)
& ( big_h(X2)
=> ( ( big_f(X4)
| big_g(X4) )
=> big_h(X4) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(4,negated_conjecture,
! [X1,X2] :
? [X3,X4] :
( ( ( big_f(X2)
& ~ big_g(X3) )
| ( big_g(X1)
& ~ big_f(X3) ) )
& ( ( ~ big_f(X1)
& ~ big_g(X1) )
| big_h(X1) )
& ( ~ big_h(X4)
| ( big_h(X2)
& ( big_f(X4)
| big_g(X4) )
& ~ big_h(X4) ) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(5,negated_conjecture,
! [X5,X6] :
? [X7,X8] :
( ( ( big_f(X6)
& ~ big_g(X7) )
| ( big_g(X5)
& ~ big_f(X7) ) )
& ( ( ~ big_f(X5)
& ~ big_g(X5) )
| big_h(X5) )
& ( ~ big_h(X8)
| ( big_h(X6)
& ( big_f(X8)
| big_g(X8) )
& ~ big_h(X8) ) ) ),
inference(variable_rename,[status(thm)],[4]) ).
fof(6,negated_conjecture,
! [X5,X6] :
( ( ( big_f(X6)
& ~ big_g(esk1_2(X5,X6)) )
| ( big_g(X5)
& ~ big_f(esk1_2(X5,X6)) ) )
& ( ( ~ big_f(X5)
& ~ big_g(X5) )
| big_h(X5) )
& ( ~ big_h(esk2_2(X5,X6))
| ( big_h(X6)
& ( big_f(esk2_2(X5,X6))
| big_g(esk2_2(X5,X6)) )
& ~ big_h(esk2_2(X5,X6)) ) ) ),
inference(skolemize,[status(esa)],[5]) ).
fof(7,negated_conjecture,
! [X5,X6] :
( ( big_g(X5)
| big_f(X6) )
& ( ~ big_f(esk1_2(X5,X6))
| big_f(X6) )
& ( big_g(X5)
| ~ big_g(esk1_2(X5,X6)) )
& ( ~ big_f(esk1_2(X5,X6))
| ~ big_g(esk1_2(X5,X6)) )
& ( ~ big_f(X5)
| big_h(X5) )
& ( ~ big_g(X5)
| big_h(X5) )
& ( big_h(X6)
| ~ big_h(esk2_2(X5,X6)) )
& ( big_f(esk2_2(X5,X6))
| big_g(esk2_2(X5,X6))
| ~ big_h(esk2_2(X5,X6)) )
& ( ~ big_h(esk2_2(X5,X6))
| ~ big_h(esk2_2(X5,X6)) ) ),
inference(distribute,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
( ~ big_h(esk2_2(X1,X2))
| ~ big_h(esk2_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(11,negated_conjecture,
( big_h(X1)
| ~ big_g(X1) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(12,negated_conjecture,
( big_h(X1)
| ~ big_f(X1) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(16,negated_conjecture,
( big_f(X1)
| big_g(X2) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(18,negated_conjecture,
~ big_g(esk2_2(X1,X2)),
inference(spm,[status(thm)],[8,11,theory(equality)]) ).
cnf(23,negated_conjecture,
big_f(X3),
inference(spm,[status(thm)],[18,16,theory(equality)]) ).
cnf(29,negated_conjecture,
( big_h(X1)
| $false ),
inference(rw,[status(thm)],[12,23,theory(equality)]) ).
cnf(30,negated_conjecture,
big_h(X1),
inference(cn,[status(thm)],[29,theory(equality)]) ).
cnf(32,negated_conjecture,
$false,
inference(rw,[status(thm)],[8,30,theory(equality)]) ).
cnf(33,negated_conjecture,
$false,
inference(cn,[status(thm)],[32,theory(equality)]) ).
cnf(34,negated_conjecture,
$false,
33,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN319+1.p
% --creating new selector for []
% -running prover on /tmp/tmpWkwrXM/sel_SYN319+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN319+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN319+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN319+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
%
%------------------------------------------------------------------------------