TSTP Solution File: SYN365+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN365+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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:17:24 EST 2010
% Result : Theorem 0.19s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 1
% Syntax : Number of formulae : 22 ( 8 unt; 0 def)
% Number of atoms : 87 ( 0 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 101 ( 36 ~; 24 |; 33 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 34 ( 0 sgn 21 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ( ! [X1] :
? [X2] :
( big_p(X1)
=> ( big_r(X1,g(h(X2)))
& big_p(X2) ) )
& ! [X3] :
( big_p(X3)
=> ( big_p(g(X3))
& big_p(h(X3)) ) ) )
=> ! [X1] :
( big_p(X1)
=> ? [X2] :
( big_r(X1,X2)
& big_p(X2) ) ) ),
file('/tmp/tmpZWMI9m/sel_SYN365+1.p_1',x2116) ).
fof(2,negated_conjecture,
~ ( ( ! [X1] :
? [X2] :
( big_p(X1)
=> ( big_r(X1,g(h(X2)))
& big_p(X2) ) )
& ! [X3] :
( big_p(X3)
=> ( big_p(g(X3))
& big_p(h(X3)) ) ) )
=> ! [X1] :
( big_p(X1)
=> ? [X2] :
( big_r(X1,X2)
& big_p(X2) ) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
( ! [X1] :
? [X2] :
( ~ big_p(X1)
| ( big_r(X1,g(h(X2)))
& big_p(X2) ) )
& ! [X3] :
( ~ big_p(X3)
| ( big_p(g(X3))
& big_p(h(X3)) ) )
& ? [X1] :
( big_p(X1)
& ! [X2] :
( ~ big_r(X1,X2)
| ~ big_p(X2) ) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
( ! [X4] :
? [X5] :
( ~ big_p(X4)
| ( big_r(X4,g(h(X5)))
& big_p(X5) ) )
& ! [X6] :
( ~ big_p(X6)
| ( big_p(g(X6))
& big_p(h(X6)) ) )
& ? [X7] :
( big_p(X7)
& ! [X8] :
( ~ big_r(X7,X8)
| ~ big_p(X8) ) ) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
( ! [X4] :
( ~ big_p(X4)
| ( big_r(X4,g(h(esk1_1(X4))))
& big_p(esk1_1(X4)) ) )
& ! [X6] :
( ~ big_p(X6)
| ( big_p(g(X6))
& big_p(h(X6)) ) )
& big_p(esk2_0)
& ! [X8] :
( ~ big_r(esk2_0,X8)
| ~ big_p(X8) ) ),
inference(skolemize,[status(esa)],[4]) ).
fof(6,negated_conjecture,
! [X4,X6,X8] :
( ( ~ big_r(esk2_0,X8)
| ~ big_p(X8) )
& big_p(esk2_0)
& ( ~ big_p(X6)
| ( big_p(g(X6))
& big_p(h(X6)) ) )
& ( ~ big_p(X4)
| ( big_r(X4,g(h(esk1_1(X4))))
& big_p(esk1_1(X4)) ) ) ),
inference(shift_quantors,[status(thm)],[5]) ).
fof(7,negated_conjecture,
! [X4,X6,X8] :
( ( ~ big_r(esk2_0,X8)
| ~ big_p(X8) )
& big_p(esk2_0)
& ( big_p(g(X6))
| ~ big_p(X6) )
& ( big_p(h(X6))
| ~ big_p(X6) )
& ( big_r(X4,g(h(esk1_1(X4))))
| ~ big_p(X4) )
& ( big_p(esk1_1(X4))
| ~ big_p(X4) ) ),
inference(distribute,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
( big_p(esk1_1(X1))
| ~ big_p(X1) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(9,negated_conjecture,
( big_r(X1,g(h(esk1_1(X1))))
| ~ big_p(X1) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(10,negated_conjecture,
( big_p(h(X1))
| ~ big_p(X1) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(11,negated_conjecture,
( big_p(g(X1))
| ~ big_p(X1) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(12,negated_conjecture,
big_p(esk2_0),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(13,negated_conjecture,
( ~ big_p(X1)
| ~ big_r(esk2_0,X1) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(14,negated_conjecture,
( ~ big_p(g(h(esk1_1(esk2_0))))
| ~ big_p(esk2_0) ),
inference(spm,[status(thm)],[13,9,theory(equality)]) ).
cnf(15,negated_conjecture,
( ~ big_p(g(h(esk1_1(esk2_0))))
| $false ),
inference(rw,[status(thm)],[14,12,theory(equality)]) ).
cnf(16,negated_conjecture,
~ big_p(g(h(esk1_1(esk2_0)))),
inference(cn,[status(thm)],[15,theory(equality)]) ).
cnf(17,negated_conjecture,
~ big_p(h(esk1_1(esk2_0))),
inference(spm,[status(thm)],[16,11,theory(equality)]) ).
cnf(18,negated_conjecture,
~ big_p(esk1_1(esk2_0)),
inference(spm,[status(thm)],[17,10,theory(equality)]) ).
cnf(19,negated_conjecture,
~ big_p(esk2_0),
inference(spm,[status(thm)],[18,8,theory(equality)]) ).
cnf(20,negated_conjecture,
$false,
inference(rw,[status(thm)],[19,12,theory(equality)]) ).
cnf(21,negated_conjecture,
$false,
inference(cn,[status(thm)],[20,theory(equality)]) ).
cnf(22,negated_conjecture,
$false,
21,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN365+1.p
% --creating new selector for []
% -running prover on /tmp/tmpZWMI9m/sel_SYN365+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN365+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN365+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN365+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
%
%------------------------------------------------------------------------------