TSTP Solution File: SYN058+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN058+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:11:09 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 9 unt; 0 def)
% Number of atoms : 79 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 77 ( 30 ~; 23 |; 18 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 32 ( 4 sgn 18 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
( ? [X1] : big_s(X1)
=> ! [X2] :
( big_f(X2)
=> big_g(X2) ) ),
file('/tmp/tmpToVTf1/sel_SYN058+1.p_1',pel28_3) ).
fof(2,axiom,
( ! [X1] :
( big_q(X1)
| big_r(X1) )
=> ? [X2] :
( big_q(X2)
& big_s(X2) ) ),
file('/tmp/tmpToVTf1/sel_SYN058+1.p_1',pel28_2) ).
fof(3,axiom,
! [X1] :
( big_p(X1)
=> ! [X3] : big_q(X3) ),
file('/tmp/tmpToVTf1/sel_SYN058+1.p_1',pel28_1) ).
fof(4,conjecture,
! [X1] :
( ( big_p(X1)
& big_f(X1) )
=> big_g(X1) ),
file('/tmp/tmpToVTf1/sel_SYN058+1.p_1',pel28) ).
fof(5,negated_conjecture,
~ ! [X1] :
( ( big_p(X1)
& big_f(X1) )
=> big_g(X1) ),
inference(assume_negation,[status(cth)],[4]) ).
fof(6,plain,
( ! [X1] : ~ big_s(X1)
| ! [X2] :
( ~ big_f(X2)
| big_g(X2) ) ),
inference(fof_nnf,[status(thm)],[1]) ).
fof(7,plain,
( ! [X3] : ~ big_s(X3)
| ! [X4] :
( ~ big_f(X4)
| big_g(X4) ) ),
inference(variable_rename,[status(thm)],[6]) ).
fof(8,plain,
! [X3,X4] :
( ~ big_f(X4)
| big_g(X4)
| ~ big_s(X3) ),
inference(shift_quantors,[status(thm)],[7]) ).
cnf(9,plain,
( big_g(X2)
| ~ big_s(X1)
| ~ big_f(X2) ),
inference(split_conjunct,[status(thm)],[8]) ).
fof(10,plain,
( ? [X1] :
( ~ big_q(X1)
& ~ big_r(X1) )
| ? [X2] :
( big_q(X2)
& big_s(X2) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(11,plain,
( ? [X3] :
( ~ big_q(X3)
& ~ big_r(X3) )
| ? [X4] :
( big_q(X4)
& big_s(X4) ) ),
inference(variable_rename,[status(thm)],[10]) ).
fof(12,plain,
( ( ~ big_q(esk1_0)
& ~ big_r(esk1_0) )
| ( big_q(esk2_0)
& big_s(esk2_0) ) ),
inference(skolemize,[status(esa)],[11]) ).
fof(13,plain,
( ( big_q(esk2_0)
| ~ big_q(esk1_0) )
& ( big_s(esk2_0)
| ~ big_q(esk1_0) )
& ( big_q(esk2_0)
| ~ big_r(esk1_0) )
& ( big_s(esk2_0)
| ~ big_r(esk1_0) ) ),
inference(distribute,[status(thm)],[12]) ).
cnf(16,plain,
( big_s(esk2_0)
| ~ big_q(esk1_0) ),
inference(split_conjunct,[status(thm)],[13]) ).
fof(18,plain,
! [X1] :
( ~ big_p(X1)
| ! [X3] : big_q(X3) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(19,plain,
! [X4] :
( ~ big_p(X4)
| ! [X5] : big_q(X5) ),
inference(variable_rename,[status(thm)],[18]) ).
fof(20,plain,
! [X4,X5] :
( big_q(X5)
| ~ big_p(X4) ),
inference(shift_quantors,[status(thm)],[19]) ).
cnf(21,plain,
( big_q(X2)
| ~ big_p(X1) ),
inference(split_conjunct,[status(thm)],[20]) ).
fof(22,negated_conjecture,
? [X1] :
( big_p(X1)
& big_f(X1)
& ~ big_g(X1) ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(23,negated_conjecture,
? [X2] :
( big_p(X2)
& big_f(X2)
& ~ big_g(X2) ),
inference(variable_rename,[status(thm)],[22]) ).
fof(24,negated_conjecture,
( big_p(esk3_0)
& big_f(esk3_0)
& ~ big_g(esk3_0) ),
inference(skolemize,[status(esa)],[23]) ).
cnf(25,negated_conjecture,
~ big_g(esk3_0),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(26,negated_conjecture,
big_f(esk3_0),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(27,negated_conjecture,
big_p(esk3_0),
inference(split_conjunct,[status(thm)],[24]) ).
cnf(28,negated_conjecture,
big_q(X1),
inference(spm,[status(thm)],[21,27,theory(equality)]) ).
cnf(34,plain,
( big_s(esk2_0)
| $false ),
inference(rw,[status(thm)],[16,28,theory(equality)]) ).
cnf(35,plain,
big_s(esk2_0),
inference(cn,[status(thm)],[34,theory(equality)]) ).
cnf(37,plain,
( big_g(X1)
| ~ big_f(X1) ),
inference(spm,[status(thm)],[9,35,theory(equality)]) ).
cnf(39,negated_conjecture,
~ big_f(esk3_0),
inference(spm,[status(thm)],[25,37,theory(equality)]) ).
cnf(40,negated_conjecture,
$false,
inference(rw,[status(thm)],[39,26,theory(equality)]) ).
cnf(41,negated_conjecture,
$false,
inference(cn,[status(thm)],[40,theory(equality)]) ).
cnf(42,negated_conjecture,
$false,
41,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN058+1.p
% --creating new selector for []
% -running prover on /tmp/tmpToVTf1/sel_SYN058+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN058+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN058+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN058+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
%
%------------------------------------------------------------------------------