TSTP Solution File: SYN375+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN375+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art01.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:18:06 EST 2010
% Result : Theorem 0.26s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 3
% Syntax : Number of formulae : 34 ( 5 unt; 0 def)
% Number of atoms : 178 ( 0 equ)
% Maximal formula atoms : 32 ( 5 avg)
% Number of connectives : 222 ( 78 ~; 109 |; 27 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 3 prp; 0-1 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 87 ( 28 sgn 41 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ! [X1] :
( big_p(X1)
<=> ? [X2] : big_p(X2) )
<=> ( ! [X1] : big_p(X1)
<=> ? [X2] : big_p(X2) ) ),
file('/tmp/tmp4ctJtm/sel_SYN375+1.p_1',x2126) ).
fof(2,negated_conjecture,
~ ( ! [X1] :
( big_p(X1)
<=> ? [X2] : big_p(X2) )
<=> ( ! [X1] : big_p(X1)
<=> ? [X2] : big_p(X2) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
( ( ? [X1] :
( ( ~ big_p(X1)
| ! [X2] : ~ big_p(X2) )
& ( big_p(X1)
| ? [X2] : big_p(X2) ) )
| ( ( ? [X1] : ~ big_p(X1)
| ! [X2] : ~ big_p(X2) )
& ( ! [X1] : big_p(X1)
| ? [X2] : big_p(X2) ) ) )
& ( ! [X1] :
( ( ~ big_p(X1)
| ? [X2] : big_p(X2) )
& ( ! [X2] : ~ big_p(X2)
| big_p(X1) ) )
| ( ( ? [X1] : ~ big_p(X1)
| ? [X2] : big_p(X2) )
& ( ! [X2] : ~ big_p(X2)
| ! [X1] : big_p(X1) ) ) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
( ( ? [X3] :
( ( ~ big_p(X3)
| ! [X4] : ~ big_p(X4) )
& ( big_p(X3)
| ? [X5] : big_p(X5) ) )
| ( ( ? [X6] : ~ big_p(X6)
| ! [X7] : ~ big_p(X7) )
& ( ! [X8] : big_p(X8)
| ? [X9] : big_p(X9) ) ) )
& ( ! [X10] :
( ( ~ big_p(X10)
| ? [X11] : big_p(X11) )
& ( ! [X12] : ~ big_p(X12)
| big_p(X10) ) )
| ( ( ? [X13] : ~ big_p(X13)
| ? [X14] : big_p(X14) )
& ( ! [X15] : ~ big_p(X15)
| ! [X16] : big_p(X16) ) ) ) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
( ( ( ( ~ big_p(esk1_0)
| ! [X4] : ~ big_p(X4) )
& ( big_p(esk1_0)
| big_p(esk2_0) ) )
| ( ( ~ big_p(esk3_0)
| ! [X7] : ~ big_p(X7) )
& ( ! [X8] : big_p(X8)
| big_p(esk4_0) ) ) )
& ( ! [X10] :
( ( ~ big_p(X10)
| big_p(esk5_1(X10)) )
& ( ! [X12] : ~ big_p(X12)
| big_p(X10) ) )
| ( ( ~ big_p(esk6_0)
| big_p(esk7_0) )
& ( ! [X15] : ~ big_p(X15)
| ! [X16] : big_p(X16) ) ) ) ),
inference(skolemize,[status(esa)],[4]) ).
fof(6,negated_conjecture,
! [X4,X7,X8,X10,X12,X15,X16] :
( ( ( ( big_p(X16)
| ~ big_p(X15) )
& ( ~ big_p(esk6_0)
| big_p(esk7_0) ) )
| ( ( ~ big_p(X12)
| big_p(X10) )
& ( ~ big_p(X10)
| big_p(esk5_1(X10)) ) ) )
& ( ( ( big_p(X8)
| big_p(esk4_0) )
& ( ~ big_p(X7)
| ~ big_p(esk3_0) ) )
| ( ( ~ big_p(X4)
| ~ big_p(esk1_0) )
& ( big_p(esk1_0)
| big_p(esk2_0) ) ) ) ),
inference(shift_quantors,[status(thm)],[5]) ).
fof(7,negated_conjecture,
! [X4,X7,X8,X10,X12,X15,X16] :
( ( ~ big_p(X12)
| big_p(X10)
| big_p(X16)
| ~ big_p(X15) )
& ( ~ big_p(X10)
| big_p(esk5_1(X10))
| big_p(X16)
| ~ big_p(X15) )
& ( ~ big_p(X12)
| big_p(X10)
| ~ big_p(esk6_0)
| big_p(esk7_0) )
& ( ~ big_p(X10)
| big_p(esk5_1(X10))
| ~ big_p(esk6_0)
| big_p(esk7_0) )
& ( ~ big_p(X4)
| ~ big_p(esk1_0)
| big_p(X8)
| big_p(esk4_0) )
& ( big_p(esk1_0)
| big_p(esk2_0)
| big_p(X8)
| big_p(esk4_0) )
& ( ~ big_p(X4)
| ~ big_p(esk1_0)
| ~ big_p(X7)
| ~ big_p(esk3_0) )
& ( big_p(esk1_0)
| big_p(esk2_0)
| ~ big_p(X7)
| ~ big_p(esk3_0) ) ),
inference(distribute,[status(thm)],[6]) ).
cnf(9,negated_conjecture,
( ~ big_p(esk3_0)
| ~ big_p(X1)
| ~ big_p(esk1_0)
| ~ big_p(X2) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(10,negated_conjecture,
( big_p(esk4_0)
| big_p(X1)
| big_p(esk2_0)
| big_p(esk1_0) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(15,negated_conjecture,
( big_p(X2)
| big_p(X3)
| ~ big_p(X1)
| ~ big_p(X4) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(16,negated_conjecture,
( big_p(esk2_0)
| big_p(esk1_0)
| big_p(esk4_0) ),
inference(ef,[status(thm)],[10,theory(equality)]) ).
fof(24,plain,
( ~ epred1_0
<=> ! [X2] :
( ~ big_p(X2)
| ~ big_p(esk3_0)
| ~ big_p(esk1_0) ) ),
introduced(definition),
[split] ).
cnf(25,plain,
( epred1_0
| ~ big_p(X2)
| ~ big_p(esk3_0)
| ~ big_p(esk1_0) ),
inference(split_equiv,[status(thm)],[24]) ).
fof(26,plain,
( ~ epred2_0
<=> ! [X1] : ~ big_p(X1) ),
introduced(definition),
[split] ).
cnf(27,plain,
( epred2_0
| ~ big_p(X1) ),
inference(split_equiv,[status(thm)],[26]) ).
cnf(28,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[9,24,theory(equality)]),26,theory(equality)]),
[split] ).
cnf(29,negated_conjecture,
( big_p(X1)
| big_p(X2)
| big_p(esk1_0)
| big_p(esk2_0)
| ~ big_p(X3) ),
inference(spm,[status(thm)],[15,16,theory(equality)]) ).
cnf(30,negated_conjecture,
( epred2_0
| big_p(esk1_0)
| big_p(esk2_0) ),
inference(spm,[status(thm)],[27,16,theory(equality)]) ).
cnf(31,negated_conjecture,
( epred2_0
| big_p(esk1_0) ),
inference(csr,[status(thm)],[30,27]) ).
cnf(32,negated_conjecture,
epred2_0,
inference(csr,[status(thm)],[31,27]) ).
cnf(34,negated_conjecture,
( $false
| ~ epred1_0 ),
inference(rw,[status(thm)],[28,32,theory(equality)]) ).
cnf(35,negated_conjecture,
~ epred1_0,
inference(cn,[status(thm)],[34,theory(equality)]) ).
cnf(36,negated_conjecture,
( ~ big_p(X2)
| ~ big_p(esk3_0)
| ~ big_p(esk1_0) ),
inference(sr,[status(thm)],[25,35,theory(equality)]) ).
cnf(37,negated_conjecture,
( big_p(esk1_0)
| big_p(X1)
| big_p(X2)
| ~ big_p(X3) ),
inference(csr,[status(thm)],[29,15]) ).
cnf(38,negated_conjecture,
( big_p(X1)
| big_p(X2)
| ~ big_p(X3) ),
inference(csr,[status(thm)],[37,15]) ).
cnf(39,negated_conjecture,
( big_p(X1)
| big_p(X2)
| big_p(esk1_0)
| big_p(esk2_0) ),
inference(spm,[status(thm)],[38,16,theory(equality)]) ).
cnf(40,negated_conjecture,
( big_p(esk1_0)
| big_p(X1)
| big_p(X2) ),
inference(csr,[status(thm)],[39,38]) ).
cnf(41,negated_conjecture,
( big_p(X1)
| big_p(X2) ),
inference(csr,[status(thm)],[40,38]) ).
cnf(42,negated_conjecture,
big_p(X3),
inference(ef,[status(thm)],[41,theory(equality)]) ).
cnf(49,negated_conjecture,
( $false
| ~ big_p(esk1_0)
| ~ big_p(X1) ),
inference(rw,[status(thm)],[36,42,theory(equality)]) ).
cnf(50,negated_conjecture,
( $false
| $false
| ~ big_p(X1) ),
inference(rw,[status(thm)],[49,42,theory(equality)]) ).
cnf(51,negated_conjecture,
( $false
| $false
| $false ),
inference(rw,[status(thm)],[50,42,theory(equality)]) ).
cnf(52,negated_conjecture,
$false,
inference(cn,[status(thm)],[51,theory(equality)]) ).
cnf(53,negated_conjecture,
$false,
52,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN375+1.p
% --creating new selector for []
% -running prover on /tmp/tmp4ctJtm/sel_SYN375+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN375+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN375+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN375+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
%
%------------------------------------------------------------------------------