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