TSTP Solution File: SEU444+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU444+1 : TPTP v5.0.0. Released v3.4.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 09:45:13 EST 2010
% Result : Theorem 0.39s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of formulae : 21 ( 6 unt; 0 def)
% Number of atoms : 47 ( 27 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 49 ( 23 ~; 14 |; 9 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-4 aty)
% Number of variables : 32 ( 0 sgn 18 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(18,conjecture,
! [X1,X2,X3] :
( m2_relset_1(X3,X2,X1)
=> ( k1_funct_5(X3) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1)
& k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k10_relset_1(X2,X1,X3,X2)) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k2_funct_5(X3)) ) ),
file('/tmp/tmpPOKbWS/sel_SEU444+1.p_1',t56_relset_2) ).
fof(27,axiom,
! [X1,X2,X3] :
( m2_relset_1(X3,X2,X1)
=> ( k1_funct_5(X3) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1)
& k2_funct_5(X3) = k10_relset_1(X2,X1,X3,X2) ) ),
file('/tmp/tmpPOKbWS/sel_SEU444+1.p_1',t51_relset_2) ).
fof(46,negated_conjecture,
~ ! [X1,X2,X3] :
( m2_relset_1(X3,X2,X1)
=> ( k1_funct_5(X3) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1)
& k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k10_relset_1(X2,X1,X3,X2)) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k2_funct_5(X3)) ) ),
inference(assume_negation,[status(cth)],[18]) ).
fof(100,negated_conjecture,
? [X1,X2,X3] :
( m2_relset_1(X3,X2,X1)
& ( k1_funct_5(X3) != k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1)
| k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k10_relset_1(X2,X1,X3,X2)) != k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k2_funct_5(X3)) ) ),
inference(fof_nnf,[status(thm)],[46]) ).
fof(101,negated_conjecture,
? [X4,X5,X6] :
( m2_relset_1(X6,X5,X4)
& ( k1_funct_5(X6) != k10_relset_1(X4,X5,k6_relset_1(X5,X4,X6),X4)
| k10_relset_1(X4,X5,k6_relset_1(X5,X4,X6),k10_relset_1(X5,X4,X6,X5)) != k10_relset_1(X4,X5,k6_relset_1(X5,X4,X6),k2_funct_5(X6)) ) ),
inference(variable_rename,[status(thm)],[100]) ).
fof(102,negated_conjecture,
( m2_relset_1(esk6_0,esk5_0,esk4_0)
& ( k1_funct_5(esk6_0) != k10_relset_1(esk4_0,esk5_0,k6_relset_1(esk5_0,esk4_0,esk6_0),esk4_0)
| k10_relset_1(esk4_0,esk5_0,k6_relset_1(esk5_0,esk4_0,esk6_0),k10_relset_1(esk5_0,esk4_0,esk6_0,esk5_0)) != k10_relset_1(esk4_0,esk5_0,k6_relset_1(esk5_0,esk4_0,esk6_0),k2_funct_5(esk6_0)) ) ),
inference(skolemize,[status(esa)],[101]) ).
cnf(103,negated_conjecture,
( k10_relset_1(esk4_0,esk5_0,k6_relset_1(esk5_0,esk4_0,esk6_0),k10_relset_1(esk5_0,esk4_0,esk6_0,esk5_0)) != k10_relset_1(esk4_0,esk5_0,k6_relset_1(esk5_0,esk4_0,esk6_0),k2_funct_5(esk6_0))
| k1_funct_5(esk6_0) != k10_relset_1(esk4_0,esk5_0,k6_relset_1(esk5_0,esk4_0,esk6_0),esk4_0) ),
inference(split_conjunct,[status(thm)],[102]) ).
cnf(104,negated_conjecture,
m2_relset_1(esk6_0,esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[102]) ).
fof(129,plain,
! [X1,X2,X3] :
( ~ m2_relset_1(X3,X2,X1)
| ( k1_funct_5(X3) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1)
& k2_funct_5(X3) = k10_relset_1(X2,X1,X3,X2) ) ),
inference(fof_nnf,[status(thm)],[27]) ).
fof(130,plain,
! [X4,X5,X6] :
( ~ m2_relset_1(X6,X5,X4)
| ( k1_funct_5(X6) = k10_relset_1(X4,X5,k6_relset_1(X5,X4,X6),X4)
& k2_funct_5(X6) = k10_relset_1(X5,X4,X6,X5) ) ),
inference(variable_rename,[status(thm)],[129]) ).
fof(131,plain,
! [X4,X5,X6] :
( ( k1_funct_5(X6) = k10_relset_1(X4,X5,k6_relset_1(X5,X4,X6),X4)
| ~ m2_relset_1(X6,X5,X4) )
& ( k2_funct_5(X6) = k10_relset_1(X5,X4,X6,X5)
| ~ m2_relset_1(X6,X5,X4) ) ),
inference(distribute,[status(thm)],[130]) ).
cnf(132,plain,
( k2_funct_5(X1) = k10_relset_1(X2,X3,X1,X2)
| ~ m2_relset_1(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[131]) ).
cnf(133,plain,
( k1_funct_5(X1) = k10_relset_1(X3,X2,k6_relset_1(X2,X3,X1),X3)
| ~ m2_relset_1(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[131]) ).
cnf(236,negated_conjecture,
( k10_relset_1(esk4_0,esk5_0,k6_relset_1(esk5_0,esk4_0,esk6_0),k10_relset_1(X1,X2,esk6_0,X1)) != k10_relset_1(esk4_0,esk5_0,k6_relset_1(esk5_0,esk4_0,esk6_0),k10_relset_1(esk5_0,esk4_0,esk6_0,esk5_0))
| k10_relset_1(esk4_0,esk5_0,k6_relset_1(esk5_0,esk4_0,esk6_0),esk4_0) != k1_funct_5(esk6_0)
| ~ m2_relset_1(esk6_0,X1,X2) ),
inference(spm,[status(thm)],[103,132,theory(equality)]) ).
cnf(1340,negated_conjecture,
( k10_relset_1(esk4_0,esk5_0,k6_relset_1(esk5_0,esk4_0,esk6_0),esk4_0) != k1_funct_5(esk6_0)
| ~ m2_relset_1(esk6_0,esk5_0,esk4_0) ),
inference(er,[status(thm)],[236,theory(equality)]) ).
cnf(1359,negated_conjecture,
( k10_relset_1(esk4_0,esk5_0,k6_relset_1(esk5_0,esk4_0,esk6_0),esk4_0) != k1_funct_5(esk6_0)
| $false ),
inference(rw,[status(thm)],[1340,104,theory(equality)]) ).
cnf(1360,negated_conjecture,
k10_relset_1(esk4_0,esk5_0,k6_relset_1(esk5_0,esk4_0,esk6_0),esk4_0) != k1_funct_5(esk6_0),
inference(cn,[status(thm)],[1359,theory(equality)]) ).
cnf(1365,negated_conjecture,
~ m2_relset_1(esk6_0,esk5_0,esk4_0),
inference(spm,[status(thm)],[1360,133,theory(equality)]) ).
cnf(1373,negated_conjecture,
$false,
inference(rw,[status(thm)],[1365,104,theory(equality)]) ).
cnf(1374,negated_conjecture,
$false,
inference(cn,[status(thm)],[1373,theory(equality)]) ).
cnf(1375,negated_conjecture,
$false,
1374,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU444+1.p
% --creating new selector for []
% -running prover on /tmp/tmpPOKbWS/sel_SEU444+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU444+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU444+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU444+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
%
%------------------------------------------------------------------------------