TSTP Solution File: SYN066+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN066+1 : TPTP v5.0.0. Bugfixed v3.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art06.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:11:55 EST 2010
% Result : Theorem 0.16s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 11 unt; 0 def)
% Number of atoms : 59 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 48 ( 18 ~; 17 |; 8 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 70 ( 9 sgn 33 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
( ? [X1,X2] : big_q(X1,X2)
=> ! [X3] : big_r(X3,X3) ),
file('/tmp/tmptrrpC4/sel_SYN066+1.p_1',pel37_3) ).
fof(2,axiom,
! [X1,X3] :
( ~ big_p(X1,X3)
=> ? [X2] : big_q(X2,X3) ),
file('/tmp/tmptrrpC4/sel_SYN066+1.p_1',pel37_2) ).
fof(3,axiom,
! [X3] :
? [X4] :
! [X1] :
? [X2] :
( ( big_p(X1,X3)
=> big_p(X2,X4) )
& big_p(X2,X3)
& ( big_p(X2,X4)
=> ? [X5] : big_q(X5,X4) ) ),
file('/tmp/tmptrrpC4/sel_SYN066+1.p_1',pel37_1) ).
fof(4,conjecture,
! [X1] :
? [X2] : big_r(X1,X2),
file('/tmp/tmptrrpC4/sel_SYN066+1.p_1',pel37) ).
fof(5,negated_conjecture,
~ ! [X1] :
? [X2] : big_r(X1,X2),
inference(assume_negation,[status(cth)],[4]) ).
fof(6,plain,
! [X1,X3] :
( ~ big_p(X1,X3)
=> ? [X2] : big_q(X2,X3) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(7,plain,
( ! [X1,X2] : ~ big_q(X1,X2)
| ! [X3] : big_r(X3,X3) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(8,plain,
( ! [X4,X5] : ~ big_q(X4,X5)
| ! [X6] : big_r(X6,X6) ),
inference(variable_rename,[status(thm)],[7]) ).
fof(9,plain,
! [X4,X5,X6] :
( big_r(X6,X6)
| ~ big_q(X4,X5) ),
inference(shift_quantors,[status(thm)],[8]) ).
cnf(10,plain,
( big_r(X3,X3)
| ~ big_q(X1,X2) ),
inference(split_conjunct,[status(thm)],[9]) ).
fof(11,plain,
! [X1,X3] :
( big_p(X1,X3)
| ? [X2] : big_q(X2,X3) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(12,plain,
! [X4,X5] :
( big_p(X4,X5)
| ? [X6] : big_q(X6,X5) ),
inference(variable_rename,[status(thm)],[11]) ).
fof(13,plain,
! [X4,X5] :
( big_p(X4,X5)
| big_q(esk1_2(X4,X5),X5) ),
inference(skolemize,[status(esa)],[12]) ).
cnf(14,plain,
( big_q(esk1_2(X1,X2),X2)
| big_p(X1,X2) ),
inference(split_conjunct,[status(thm)],[13]) ).
fof(15,plain,
! [X3] :
? [X4] :
! [X1] :
? [X2] :
( ( ~ big_p(X1,X3)
| big_p(X2,X4) )
& big_p(X2,X3)
& ( ~ big_p(X2,X4)
| ? [X5] : big_q(X5,X4) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(16,plain,
! [X6] :
? [X7] :
! [X8] :
? [X9] :
( ( ~ big_p(X8,X6)
| big_p(X9,X7) )
& big_p(X9,X6)
& ( ~ big_p(X9,X7)
| ? [X10] : big_q(X10,X7) ) ),
inference(variable_rename,[status(thm)],[15]) ).
fof(17,plain,
! [X6,X8] :
( ( ~ big_p(X8,X6)
| big_p(esk3_2(X6,X8),esk2_1(X6)) )
& big_p(esk3_2(X6,X8),X6)
& ( ~ big_p(esk3_2(X6,X8),esk2_1(X6))
| big_q(esk4_2(X6,X8),esk2_1(X6)) ) ),
inference(skolemize,[status(esa)],[16]) ).
cnf(18,plain,
( big_q(esk4_2(X1,X2),esk2_1(X1))
| ~ big_p(esk3_2(X1,X2),esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[17]) ).
fof(21,negated_conjecture,
? [X1] :
! [X2] : ~ big_r(X1,X2),
inference(fof_nnf,[status(thm)],[5]) ).
fof(22,negated_conjecture,
? [X3] :
! [X4] : ~ big_r(X3,X4),
inference(variable_rename,[status(thm)],[21]) ).
fof(23,negated_conjecture,
! [X4] : ~ big_r(esk5_0,X4),
inference(skolemize,[status(esa)],[22]) ).
cnf(24,negated_conjecture,
~ big_r(esk5_0,X1),
inference(split_conjunct,[status(thm)],[23]) ).
cnf(25,plain,
( big_r(X1,X1)
| big_p(X2,X3) ),
inference(spm,[status(thm)],[10,14,theory(equality)]) ).
cnf(27,negated_conjecture,
big_p(X1,X2),
inference(spm,[status(thm)],[24,25,theory(equality)]) ).
cnf(30,plain,
( big_q(esk4_2(X1,X2),esk2_1(X1))
| $false ),
inference(rw,[status(thm)],[18,27,theory(equality)]) ).
cnf(31,plain,
big_q(esk4_2(X1,X2),esk2_1(X1)),
inference(cn,[status(thm)],[30,theory(equality)]) ).
cnf(36,plain,
big_r(X1,X1),
inference(spm,[status(thm)],[10,31,theory(equality)]) ).
cnf(37,negated_conjecture,
$false,
inference(spm,[status(thm)],[24,36,theory(equality)]) ).
cnf(39,negated_conjecture,
$false,
37,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN066+1.p
% --creating new selector for []
% -running prover on /tmp/tmptrrpC4/sel_SYN066+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN066+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN066+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN066+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
%
%------------------------------------------------------------------------------