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