TSTP Solution File: SYN063+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN063+1 : TPTP v5.0.0. Released v2.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:40 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 : 26 ( 5 unt; 0 def)
% Number of atoms : 276 ( 0 equ)
% Maximal formula atoms : 114 ( 10 avg)
% Number of connectives : 376 ( 126 ~; 169 |; 72 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 36 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 33 ( 13 sgn 16 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ! [X1] :
( ( big_p(a)
& ( big_p(X1)
=> big_p(b) ) )
=> big_p(c) )
<=> ! [X2] :
( ( ~ big_p(a)
| big_p(X2)
| big_p(c) )
& ( ~ big_p(a)
| ~ big_p(b)
| big_p(c) ) ) ),
file('/tmp/tmpafPTkC/sel_SYN063+1.p_1',pel33) ).
fof(2,negated_conjecture,
~ ( ! [X1] :
( ( big_p(a)
& ( big_p(X1)
=> big_p(b) ) )
=> big_p(c) )
<=> ! [X2] :
( ( ~ big_p(a)
| big_p(X2)
| big_p(c) )
& ( ~ big_p(a)
| ~ big_p(b)
| big_p(c) ) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
~ ( ! [X1] :
( ( big_p(a)
& ( big_p(X1)
=> big_p(b) ) )
=> big_p(c) )
<=> ! [X2] :
( ( ~ big_p(a)
| big_p(X2)
| big_p(c) )
& ( ~ big_p(a)
| ~ big_p(b)
| big_p(c) ) ) ),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
fof(4,negated_conjecture,
( ( ? [X1] :
( big_p(a)
& ( ~ big_p(X1)
| big_p(b) )
& ~ big_p(c) )
| ? [X2] :
( ( big_p(a)
& ~ big_p(X2)
& ~ big_p(c) )
| ( big_p(a)
& big_p(b)
& ~ big_p(c) ) ) )
& ( ! [X1] :
( ~ big_p(a)
| ( big_p(X1)
& ~ big_p(b) )
| big_p(c) )
| ! [X2] :
( ( ~ big_p(a)
| big_p(X2)
| big_p(c) )
& ( ~ big_p(a)
| ~ big_p(b)
| big_p(c) ) ) ) ),
inference(fof_nnf,[status(thm)],[3]) ).
fof(5,negated_conjecture,
( ( ? [X3] :
( big_p(a)
& ( ~ big_p(X3)
| big_p(b) )
& ~ big_p(c) )
| ? [X4] :
( ( big_p(a)
& ~ big_p(X4)
& ~ big_p(c) )
| ( big_p(a)
& big_p(b)
& ~ big_p(c) ) ) )
& ( ! [X5] :
( ~ big_p(a)
| ( big_p(X5)
& ~ big_p(b) )
| big_p(c) )
| ! [X6] :
( ( ~ big_p(a)
| big_p(X6)
| big_p(c) )
& ( ~ big_p(a)
| ~ big_p(b)
| big_p(c) ) ) ) ),
inference(variable_rename,[status(thm)],[4]) ).
fof(6,negated_conjecture,
( ( ( big_p(a)
& ( ~ big_p(esk1_0)
| big_p(b) )
& ~ big_p(c) )
| ( big_p(a)
& ~ big_p(esk2_0)
& ~ big_p(c) )
| ( big_p(a)
& big_p(b)
& ~ big_p(c) ) )
& ( ! [X5] :
( ~ big_p(a)
| ( big_p(X5)
& ~ big_p(b) )
| big_p(c) )
| ! [X6] :
( ( ~ big_p(a)
| big_p(X6)
| big_p(c) )
& ( ~ big_p(a)
| ~ big_p(b)
| big_p(c) ) ) ) ),
inference(skolemize,[status(esa)],[5]) ).
fof(7,negated_conjecture,
! [X5,X6] :
( ( ( ( ~ big_p(a)
| big_p(X6)
| big_p(c) )
& ( ~ big_p(a)
| ~ big_p(b)
| big_p(c) ) )
| ~ big_p(a)
| ( big_p(X5)
& ~ big_p(b) )
| big_p(c) )
& ( ( big_p(a)
& ( ~ big_p(esk1_0)
| big_p(b) )
& ~ big_p(c) )
| ( big_p(a)
& ~ big_p(esk2_0)
& ~ big_p(c) )
| ( big_p(a)
& big_p(b)
& ~ big_p(c) ) ) ),
inference(shift_quantors,[status(thm)],[6]) ).
fof(8,negated_conjecture,
! [X5,X6] :
( ( big_p(X5)
| ~ big_p(a)
| big_p(c)
| ~ big_p(a)
| big_p(X6)
| big_p(c) )
& ( ~ big_p(b)
| ~ big_p(a)
| big_p(c)
| ~ big_p(a)
| big_p(X6)
| big_p(c) )
& ( big_p(X5)
| ~ big_p(a)
| big_p(c)
| ~ big_p(a)
| ~ big_p(b)
| big_p(c) )
& ( ~ big_p(b)
| ~ big_p(a)
| big_p(c)
| ~ big_p(a)
| ~ big_p(b)
| big_p(c) )
& ( big_p(a)
| big_p(a)
| big_p(a) )
& ( big_p(b)
| big_p(a)
| big_p(a) )
& ( ~ big_p(c)
| big_p(a)
| big_p(a) )
& ( big_p(a)
| ~ big_p(esk2_0)
| big_p(a) )
& ( big_p(b)
| ~ big_p(esk2_0)
| big_p(a) )
& ( ~ big_p(c)
| ~ big_p(esk2_0)
| big_p(a) )
& ( big_p(a)
| ~ big_p(c)
| big_p(a) )
& ( big_p(b)
| ~ big_p(c)
| big_p(a) )
& ( ~ big_p(c)
| ~ big_p(c)
| big_p(a) )
& ( big_p(a)
| big_p(a)
| ~ big_p(esk1_0)
| big_p(b) )
& ( big_p(b)
| big_p(a)
| ~ big_p(esk1_0)
| big_p(b) )
& ( ~ big_p(c)
| big_p(a)
| ~ big_p(esk1_0)
| big_p(b) )
& ( big_p(a)
| ~ big_p(esk2_0)
| ~ big_p(esk1_0)
| big_p(b) )
& ( big_p(b)
| ~ big_p(esk2_0)
| ~ big_p(esk1_0)
| big_p(b) )
& ( ~ big_p(c)
| ~ big_p(esk2_0)
| ~ big_p(esk1_0)
| big_p(b) )
& ( big_p(a)
| ~ big_p(c)
| ~ big_p(esk1_0)
| big_p(b) )
& ( big_p(b)
| ~ big_p(c)
| ~ big_p(esk1_0)
| big_p(b) )
& ( ~ big_p(c)
| ~ big_p(c)
| ~ big_p(esk1_0)
| big_p(b) )
& ( big_p(a)
| big_p(a)
| ~ big_p(c) )
& ( big_p(b)
| big_p(a)
| ~ big_p(c) )
& ( ~ big_p(c)
| big_p(a)
| ~ big_p(c) )
& ( big_p(a)
| ~ big_p(esk2_0)
| ~ big_p(c) )
& ( big_p(b)
| ~ big_p(esk2_0)
| ~ big_p(c) )
& ( ~ big_p(c)
| ~ big_p(esk2_0)
| ~ big_p(c) )
& ( big_p(a)
| ~ big_p(c)
| ~ big_p(c) )
& ( big_p(b)
| ~ big_p(c)
| ~ big_p(c) )
& ( ~ big_p(c)
| ~ big_p(c)
| ~ big_p(c) ) ),
inference(distribute,[status(thm)],[7]) ).
cnf(9,negated_conjecture,
( ~ big_p(c)
| ~ big_p(c)
| ~ big_p(c) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(35,negated_conjecture,
( big_p(a)
| big_p(a)
| big_p(a) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(36,negated_conjecture,
( big_p(c)
| big_p(c)
| ~ big_p(b)
| ~ big_p(a)
| ~ big_p(a)
| ~ big_p(b) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(37,negated_conjecture,
( big_p(c)
| big_p(c)
| big_p(X1)
| ~ big_p(b)
| ~ big_p(a)
| ~ big_p(a) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(39,negated_conjecture,
( big_p(c)
| big_p(X1)
| big_p(c)
| big_p(X2)
| ~ big_p(a)
| ~ big_p(a) ),
inference(split_conjunct,[status(thm)],[8]) ).
cnf(55,negated_conjecture,
( big_p(c)
| $false
| ~ big_p(b) ),
inference(rw,[status(thm)],[36,35,theory(equality)]) ).
cnf(56,negated_conjecture,
( big_p(c)
| ~ big_p(b) ),
inference(cn,[status(thm)],[55,theory(equality)]) ).
cnf(57,negated_conjecture,
~ big_p(b),
inference(sr,[status(thm)],[56,9,theory(equality)]) ).
cnf(58,negated_conjecture,
( big_p(X2)
| big_p(X1)
| big_p(c)
| $false ),
inference(rw,[status(thm)],[39,35,theory(equality)]) ).
cnf(59,negated_conjecture,
( big_p(X2)
| big_p(X1)
| big_p(c) ),
inference(cn,[status(thm)],[58,theory(equality)]) ).
cnf(60,negated_conjecture,
( big_p(X2)
| big_p(X1) ),
inference(sr,[status(thm)],[59,9,theory(equality)]) ).
cnf(71,negated_conjecture,
( big_p(X1)
| big_p(c)
| $false
| ~ big_p(b) ),
inference(rw,[status(thm)],[37,35,theory(equality)]) ).
cnf(72,negated_conjecture,
( big_p(X1)
| big_p(c)
| ~ big_p(b) ),
inference(cn,[status(thm)],[71,theory(equality)]) ).
cnf(73,negated_conjecture,
( big_p(X1)
| ~ big_p(b) ),
inference(sr,[status(thm)],[72,9,theory(equality)]) ).
cnf(74,negated_conjecture,
big_p(X1),
inference(csr,[status(thm)],[73,60]) ).
cnf(76,negated_conjecture,
$false,
inference(rw,[status(thm)],[57,74,theory(equality)]) ).
cnf(77,negated_conjecture,
$false,
inference(cn,[status(thm)],[76,theory(equality)]) ).
cnf(78,negated_conjecture,
$false,
77,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN063+1.p
% --creating new selector for []
% -running prover on /tmp/tmpafPTkC/sel_SYN063+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN063+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN063+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN063+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
%
%------------------------------------------------------------------------------