TSTP Solution File: ALG201+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : ALG201+1 : TPTP v5.0.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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 : Sat Dec 25 04:15:49 EST 2010
% Result : Theorem 0.22s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 6 unt; 0 def)
% Number of atoms : 102 ( 32 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 124 ( 45 ~; 33 |; 26 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn 44 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(2,axiom,
! [X1] :
( sorti1(X1)
=> op1(X1,X1) != X1 ),
file('/tmp/tmpf0puol/sel_ALG201+1.p_1',ax3) ).
fof(3,conjecture,
( ( ! [X1] :
( sorti1(X1)
=> sorti2(h(X1)) )
& ! [X2] :
( sorti2(X2)
=> sorti1(j(X2)) ) )
=> ~ ( ! [X3] :
( sorti1(X3)
=> ! [X4] :
( sorti1(X4)
=> h(op1(X3,X4)) = op2(h(X3),h(X4)) ) )
& ! [X5] :
( sorti2(X5)
=> ! [X6] :
( sorti2(X6)
=> j(op2(X5,X6)) = op1(j(X5),j(X6)) ) )
& ! [X7] :
( sorti2(X7)
=> h(j(X7)) = X7 )
& ! [X8] :
( sorti1(X8)
=> j(h(X8)) = X8 ) ) ),
file('/tmp/tmpf0puol/sel_ALG201+1.p_1',co1) ).
fof(5,axiom,
~ ! [X1] :
( sorti2(X1)
=> op2(X1,X1) != X1 ),
file('/tmp/tmpf0puol/sel_ALG201+1.p_1',ax4) ).
fof(6,negated_conjecture,
~ ( ( ! [X1] :
( sorti1(X1)
=> sorti2(h(X1)) )
& ! [X2] :
( sorti2(X2)
=> sorti1(j(X2)) ) )
=> ~ ( ! [X3] :
( sorti1(X3)
=> ! [X4] :
( sorti1(X4)
=> h(op1(X3,X4)) = op2(h(X3),h(X4)) ) )
& ! [X5] :
( sorti2(X5)
=> ! [X6] :
( sorti2(X6)
=> j(op2(X5,X6)) = op1(j(X5),j(X6)) ) )
& ! [X7] :
( sorti2(X7)
=> h(j(X7)) = X7 )
& ! [X8] :
( sorti1(X8)
=> j(h(X8)) = X8 ) ) ),
inference(assume_negation,[status(cth)],[3]) ).
fof(11,plain,
! [X1] :
( ~ sorti1(X1)
| op1(X1,X1) != X1 ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(12,plain,
! [X2] :
( ~ sorti1(X2)
| op1(X2,X2) != X2 ),
inference(variable_rename,[status(thm)],[11]) ).
cnf(13,plain,
( op1(X1,X1) != X1
| ~ sorti1(X1) ),
inference(split_conjunct,[status(thm)],[12]) ).
fof(14,negated_conjecture,
( ! [X1] :
( ~ sorti1(X1)
| sorti2(h(X1)) )
& ! [X2] :
( ~ sorti2(X2)
| sorti1(j(X2)) )
& ! [X3] :
( ~ sorti1(X3)
| ! [X4] :
( ~ sorti1(X4)
| h(op1(X3,X4)) = op2(h(X3),h(X4)) ) )
& ! [X5] :
( ~ sorti2(X5)
| ! [X6] :
( ~ sorti2(X6)
| j(op2(X5,X6)) = op1(j(X5),j(X6)) ) )
& ! [X7] :
( ~ sorti2(X7)
| h(j(X7)) = X7 )
& ! [X8] :
( ~ sorti1(X8)
| j(h(X8)) = X8 ) ),
inference(fof_nnf,[status(thm)],[6]) ).
fof(15,negated_conjecture,
( ! [X9] :
( ~ sorti1(X9)
| sorti2(h(X9)) )
& ! [X10] :
( ~ sorti2(X10)
| sorti1(j(X10)) )
& ! [X11] :
( ~ sorti1(X11)
| ! [X12] :
( ~ sorti1(X12)
| h(op1(X11,X12)) = op2(h(X11),h(X12)) ) )
& ! [X13] :
( ~ sorti2(X13)
| ! [X14] :
( ~ sorti2(X14)
| j(op2(X13,X14)) = op1(j(X13),j(X14)) ) )
& ! [X15] :
( ~ sorti2(X15)
| h(j(X15)) = X15 )
& ! [X16] :
( ~ sorti1(X16)
| j(h(X16)) = X16 ) ),
inference(variable_rename,[status(thm)],[14]) ).
fof(16,negated_conjecture,
! [X9,X10,X11,X12,X13,X14,X15,X16] :
( ( ~ sorti1(X16)
| j(h(X16)) = X16 )
& ( ~ sorti2(X15)
| h(j(X15)) = X15 )
& ( ~ sorti2(X14)
| j(op2(X13,X14)) = op1(j(X13),j(X14))
| ~ sorti2(X13) )
& ( ~ sorti1(X12)
| h(op1(X11,X12)) = op2(h(X11),h(X12))
| ~ sorti1(X11) )
& ( ~ sorti2(X10)
| sorti1(j(X10)) )
& ( ~ sorti1(X9)
| sorti2(h(X9)) ) ),
inference(shift_quantors,[status(thm)],[15]) ).
cnf(18,negated_conjecture,
( sorti1(j(X1))
| ~ sorti2(X1) ),
inference(split_conjunct,[status(thm)],[16]) ).
cnf(20,negated_conjecture,
( j(op2(X1,X2)) = op1(j(X1),j(X2))
| ~ sorti2(X1)
| ~ sorti2(X2) ),
inference(split_conjunct,[status(thm)],[16]) ).
fof(27,plain,
? [X1] :
( sorti2(X1)
& op2(X1,X1) = X1 ),
inference(fof_nnf,[status(thm)],[5]) ).
fof(28,plain,
? [X2] :
( sorti2(X2)
& op2(X2,X2) = X2 ),
inference(variable_rename,[status(thm)],[27]) ).
fof(29,plain,
( sorti2(esk1_0)
& op2(esk1_0,esk1_0) = esk1_0 ),
inference(skolemize,[status(esa)],[28]) ).
cnf(30,plain,
op2(esk1_0,esk1_0) = esk1_0,
inference(split_conjunct,[status(thm)],[29]) ).
cnf(31,plain,
sorti2(esk1_0),
inference(split_conjunct,[status(thm)],[29]) ).
cnf(40,negated_conjecture,
( j(op2(X1,X1)) != j(X1)
| ~ sorti1(j(X1))
| ~ sorti2(X1) ),
inference(spm,[status(thm)],[13,20,theory(equality)]) ).
cnf(77,negated_conjecture,
( j(op2(X1,X1)) != j(X1)
| ~ sorti2(X1) ),
inference(csr,[status(thm)],[40,18]) ).
cnf(78,negated_conjecture,
~ sorti2(esk1_0),
inference(spm,[status(thm)],[77,30,theory(equality)]) ).
cnf(79,negated_conjecture,
$false,
inference(rw,[status(thm)],[78,31,theory(equality)]) ).
cnf(80,negated_conjecture,
$false,
inference(cn,[status(thm)],[79,theory(equality)]) ).
cnf(81,negated_conjecture,
$false,
80,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/ALG/ALG201+1.p
% --creating new selector for []
% -running prover on /tmp/tmpf0puol/sel_ALG201+1.p_1 with time limit 29
% -prover status Theorem
% Problem ALG201+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/ALG/ALG201+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/ALG/ALG201+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
%
%------------------------------------------------------------------------------