TSTP Solution File: SYN078+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN078+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:12:57 EST 2010
% Result : Theorem 0.17s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 1
% Syntax : Number of formulae : 34 ( 9 unt; 0 def)
% Number of atoms : 119 ( 19 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 132 ( 47 ~; 55 |; 24 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 33 ( 0 sgn 19 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ! [X1] :
( ? [X2] :
( big_p(X2)
& X1 = f(X2) )
=> big_p(X1) )
<=> ! [X3] :
( big_p(X3)
=> big_p(f(X3)) ) ),
file('/tmp/tmpSwraFy/sel_SYN078+1.p_1',pel56) ).
fof(2,negated_conjecture,
~ ( ! [X1] :
( ? [X2] :
( big_p(X2)
& X1 = f(X2) )
=> big_p(X1) )
<=> ! [X3] :
( big_p(X3)
=> big_p(f(X3)) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
( ( ? [X1] :
( ? [X2] :
( big_p(X2)
& X1 = f(X2) )
& ~ big_p(X1) )
| ? [X3] :
( big_p(X3)
& ~ big_p(f(X3)) ) )
& ( ! [X1] :
( ! [X2] :
( ~ big_p(X2)
| X1 != f(X2) )
| big_p(X1) )
| ! [X3] :
( ~ big_p(X3)
| big_p(f(X3)) ) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
( ( ? [X4] :
( ? [X5] :
( big_p(X5)
& X4 = f(X5) )
& ~ big_p(X4) )
| ? [X6] :
( big_p(X6)
& ~ big_p(f(X6)) ) )
& ( ! [X7] :
( ! [X8] :
( ~ big_p(X8)
| X7 != f(X8) )
| big_p(X7) )
| ! [X9] :
( ~ big_p(X9)
| big_p(f(X9)) ) ) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
( ( ( big_p(esk2_0)
& esk1_0 = f(esk2_0)
& ~ big_p(esk1_0) )
| ( big_p(esk3_0)
& ~ big_p(f(esk3_0)) ) )
& ( ! [X7] :
( ! [X8] :
( ~ big_p(X8)
| X7 != f(X8) )
| big_p(X7) )
| ! [X9] :
( ~ big_p(X9)
| big_p(f(X9)) ) ) ),
inference(skolemize,[status(esa)],[4]) ).
fof(6,negated_conjecture,
! [X7,X8,X9] :
( ( ~ big_p(X9)
| big_p(f(X9))
| ~ big_p(X8)
| X7 != f(X8)
| big_p(X7) )
& ( ( big_p(esk2_0)
& esk1_0 = f(esk2_0)
& ~ big_p(esk1_0) )
| ( big_p(esk3_0)
& ~ big_p(f(esk3_0)) ) ) ),
inference(shift_quantors,[status(thm)],[5]) ).
fof(7,negated_conjecture,
! [X7,X8,X9] :
( ( ~ big_p(X9)
| big_p(f(X9))
| ~ big_p(X8)
| X7 != f(X8)
| big_p(X7) )
& ( big_p(esk3_0)
| big_p(esk2_0) )
& ( ~ big_p(f(esk3_0))
| big_p(esk2_0) )
& ( big_p(esk3_0)
| esk1_0 = f(esk2_0) )
& ( ~ big_p(f(esk3_0))
| esk1_0 = f(esk2_0) )
& ( big_p(esk3_0)
| ~ big_p(esk1_0) )
& ( ~ big_p(f(esk3_0))
| ~ big_p(esk1_0) ) ),
inference(distribute,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
( ~ big_p(esk1_0)
| ~ big_p(f(esk3_0)) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(9,negated_conjecture,
( big_p(esk3_0)
| ~ big_p(esk1_0) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(10,negated_conjecture,
( esk1_0 = f(esk2_0)
| ~ big_p(f(esk3_0)) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(11,negated_conjecture,
( esk1_0 = f(esk2_0)
| big_p(esk3_0) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(12,negated_conjecture,
( big_p(esk2_0)
| ~ big_p(f(esk3_0)) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(13,negated_conjecture,
( big_p(esk2_0)
| big_p(esk3_0) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(14,negated_conjecture,
( big_p(X1)
| big_p(f(X3))
| X1 != f(X2)
| ~ big_p(X2)
| ~ big_p(X3) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(15,negated_conjecture,
( big_p(f(X1))
| big_p(f(X2))
| ~ big_p(X1)
| ~ big_p(X2) ),
inference(er,[status(thm)],[14,theory(equality)]) ).
cnf(17,negated_conjecture,
( big_p(f(X3))
| ~ big_p(X3) ),
inference(ef,[status(thm)],[15,theory(equality)]) ).
cnf(27,negated_conjecture,
( big_p(esk2_0)
| ~ big_p(esk3_0) ),
inference(spm,[status(thm)],[12,17,theory(equality)]) ).
cnf(28,negated_conjecture,
( big_p(esk1_0)
| big_p(esk3_0)
| ~ big_p(esk2_0) ),
inference(spm,[status(thm)],[17,11,theory(equality)]) ).
cnf(29,negated_conjecture,
( f(esk2_0) = esk1_0
| ~ big_p(esk3_0) ),
inference(spm,[status(thm)],[10,17,theory(equality)]) ).
cnf(30,negated_conjecture,
big_p(esk2_0),
inference(csr,[status(thm)],[27,13]) ).
cnf(33,negated_conjecture,
( big_p(esk1_0)
| big_p(esk3_0)
| $false ),
inference(rw,[status(thm)],[28,30,theory(equality)]) ).
cnf(34,negated_conjecture,
( big_p(esk1_0)
| big_p(esk3_0) ),
inference(cn,[status(thm)],[33,theory(equality)]) ).
cnf(35,negated_conjecture,
big_p(esk3_0),
inference(csr,[status(thm)],[34,9]) ).
cnf(38,negated_conjecture,
( f(esk2_0) = esk1_0
| $false ),
inference(rw,[status(thm)],[29,35,theory(equality)]) ).
cnf(39,negated_conjecture,
f(esk2_0) = esk1_0,
inference(cn,[status(thm)],[38,theory(equality)]) ).
cnf(40,negated_conjecture,
( big_p(esk1_0)
| ~ big_p(esk2_0) ),
inference(spm,[status(thm)],[17,39,theory(equality)]) ).
cnf(42,negated_conjecture,
( big_p(esk1_0)
| $false ),
inference(rw,[status(thm)],[40,30,theory(equality)]) ).
cnf(43,negated_conjecture,
big_p(esk1_0),
inference(cn,[status(thm)],[42,theory(equality)]) ).
cnf(44,negated_conjecture,
( ~ big_p(f(esk3_0))
| $false ),
inference(rw,[status(thm)],[8,43,theory(equality)]) ).
cnf(45,negated_conjecture,
~ big_p(f(esk3_0)),
inference(cn,[status(thm)],[44,theory(equality)]) ).
cnf(46,negated_conjecture,
~ big_p(esk3_0),
inference(spm,[status(thm)],[45,17,theory(equality)]) ).
cnf(47,negated_conjecture,
$false,
inference(rw,[status(thm)],[46,35,theory(equality)]) ).
cnf(48,negated_conjecture,
$false,
inference(cn,[status(thm)],[47,theory(equality)]) ).
cnf(49,negated_conjecture,
$false,
48,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN078+1.p
% --creating new selector for []
% -running prover on /tmp/tmpSwraFy/sel_SYN078+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN078+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN078+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN078+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
%
%------------------------------------------------------------------------------