TSTP Solution File: SYN364+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN364+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:17:20 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 1
% Syntax : Number of formulae : 21 ( 6 unt; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 10 ( 4 avg)
% Number of connectives : 110 ( 38 ~; 31 |; 32 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 72 ( 8 sgn 45 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ( ! [X1] :
( ? [X2] : big_p(X1,X2)
=> ! [X3] : big_p(X3,X3) )
& ! [X4] :
? [X5] :
( big_p(X4,X5)
| ( big_m(X4)
& big_q(f(X4,X5)) ) )
& ! [X6] :
( big_q(X6)
=> ~ big_m(g(X6)) ) )
=> ! [X4] :
? [X5] :
( big_p(g(X4),X5)
& big_p(X4,X4) ) ),
file('/tmp/tmpxCXEKP/sel_SYN364+1.p_1',x2115) ).
fof(2,negated_conjecture,
~ ( ( ! [X1] :
( ? [X2] : big_p(X1,X2)
=> ! [X3] : big_p(X3,X3) )
& ! [X4] :
? [X5] :
( big_p(X4,X5)
| ( big_m(X4)
& big_q(f(X4,X5)) ) )
& ! [X6] :
( big_q(X6)
=> ~ big_m(g(X6)) ) )
=> ! [X4] :
? [X5] :
( big_p(g(X4),X5)
& big_p(X4,X4) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
~ ( ( ! [X1] :
( ? [X2] : big_p(X1,X2)
=> ! [X3] : big_p(X3,X3) )
& ! [X4] :
? [X5] :
( big_p(X4,X5)
| ( big_m(X4)
& big_q(f(X4,X5)) ) )
& ! [X6] :
( big_q(X6)
=> ~ big_m(g(X6)) ) )
=> ! [X4] :
? [X5] :
( big_p(g(X4),X5)
& big_p(X4,X4) ) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(4,negated_conjecture,
( ! [X1] :
( ! [X2] : ~ big_p(X1,X2)
| ! [X3] : big_p(X3,X3) )
& ! [X4] :
? [X5] :
( big_p(X4,X5)
| ( big_m(X4)
& big_q(f(X4,X5)) ) )
& ! [X6] :
( ~ big_q(X6)
| ~ big_m(g(X6)) )
& ? [X4] :
! [X5] :
( ~ big_p(g(X4),X5)
| ~ big_p(X4,X4) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(5,negated_conjecture,
( ! [X7] :
( ! [X8] : ~ big_p(X7,X8)
| ! [X9] : big_p(X9,X9) )
& ! [X10] :
? [X11] :
( big_p(X10,X11)
| ( big_m(X10)
& big_q(f(X10,X11)) ) )
& ! [X12] :
( ~ big_q(X12)
| ~ big_m(g(X12)) )
& ? [X13] :
! [X14] :
( ~ big_p(g(X13),X14)
| ~ big_p(X13,X13) ) ),
inference(variable_rename,[status(thm)],[4]) ).
fof(6,negated_conjecture,
( ! [X7] :
( ! [X8] : ~ big_p(X7,X8)
| ! [X9] : big_p(X9,X9) )
& ! [X10] :
( big_p(X10,esk1_1(X10))
| ( big_m(X10)
& big_q(f(X10,esk1_1(X10))) ) )
& ! [X12] :
( ~ big_q(X12)
| ~ big_m(g(X12)) )
& ! [X14] :
( ~ big_p(g(esk2_0),X14)
| ~ big_p(esk2_0,esk2_0) ) ),
inference(skolemize,[status(esa)],[5]) ).
fof(7,negated_conjecture,
! [X7,X8,X9,X10,X12,X14] :
( ( ~ big_p(g(esk2_0),X14)
| ~ big_p(esk2_0,esk2_0) )
& ( ~ big_q(X12)
| ~ big_m(g(X12)) )
& ( big_p(X10,esk1_1(X10))
| ( big_m(X10)
& big_q(f(X10,esk1_1(X10))) ) )
& ( big_p(X9,X9)
| ~ big_p(X7,X8) ) ),
inference(shift_quantors,[status(thm)],[6]) ).
fof(8,negated_conjecture,
! [X7,X8,X9,X10,X12,X14] :
( ( ~ big_p(g(esk2_0),X14)
| ~ big_p(esk2_0,esk2_0) )
& ( ~ big_q(X12)
| ~ big_m(g(X12)) )
& ( big_m(X10)
| big_p(X10,esk1_1(X10)) )
& ( big_q(f(X10,esk1_1(X10)))
| big_p(X10,esk1_1(X10)) )
& ( big_p(X9,X9)
| ~ big_p(X7,X8) ) ),
inference(distribute,[status(thm)],[7]) ).
cnf(9,negated_conjecture,
( big_p(X3,X3)
| ~ big_p(X1,X2) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(10,negated_conjecture,
( big_p(X1,esk1_1(X1))
| big_q(f(X1,esk1_1(X1))) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(11,negated_conjecture,
( big_p(X1,esk1_1(X1))
| big_m(X1) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(12,negated_conjecture,
( ~ big_m(g(X1))
| ~ big_q(X1) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(13,negated_conjecture,
( ~ big_p(esk2_0,esk2_0)
| ~ big_p(g(esk2_0),X1) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(14,negated_conjecture,
( big_p(X1,X1)
| big_m(X2) ),
inference(spm,[status(thm)],[9,11,theory(equality)]) ).
cnf(15,negated_conjecture,
~ big_p(g(esk2_0),X1),
inference(csr,[status(thm)],[13,9]) ).
cnf(18,negated_conjecture,
big_m(X1),
inference(spm,[status(thm)],[15,14,theory(equality)]) ).
cnf(24,negated_conjecture,
( ~ big_q(X1)
| $false ),
inference(rw,[status(thm)],[12,18,theory(equality)]) ).
cnf(25,negated_conjecture,
~ big_q(X1),
inference(cn,[status(thm)],[24,theory(equality)]) ).
cnf(26,negated_conjecture,
big_p(X1,esk1_1(X1)),
inference(sr,[status(thm)],[10,25,theory(equality)]) ).
cnf(27,negated_conjecture,
$false,
inference(spm,[status(thm)],[15,26,theory(equality)]) ).
cnf(29,negated_conjecture,
$false,
27,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN364+1.p
% --creating new selector for []
% -running prover on /tmp/tmpxCXEKP/sel_SYN364+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN364+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN364+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN364+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
%
%------------------------------------------------------------------------------