TSTP Solution File: ALG199+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : ALG199+1 : TPTP v5.0.0. Released v2.7.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 : Sat Dec 25 04:15:32 EST 2010
% Result : Theorem 0.26s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 28 ( 15 unt; 0 def)
% Number of atoms : 146 ( 144 equ)
% Maximal formula atoms : 21 ( 5 avg)
% Number of connectives : 191 ( 73 ~; 69 |; 49 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(4,axiom,
( e0 = op(op(op(e5,op(e5,e5)),op(e5,op(e5,e5))),op(e5,op(e5,e5)))
& e1 = op(e5,e5)
& e2 = op(op(e5,op(e5,e5)),op(e5,op(e5,e5)))
& e3 = op(op(op(e5,op(e5,e5)),op(e5,op(e5,e5))),e5)
& e4 = op(e5,op(e5,e5))
& e6 = op(op(op(op(e5,op(e5,e5)),op(e5,op(e5,e5))),e5),op(e5,op(e5,e5))) ),
file('/tmp/tmpyuiEdf/sel_ALG199+1.p_1',ax6) ).
fof(6,axiom,
( e0 != e1
& e0 != e2
& e0 != e3
& e0 != e4
& e0 != e5
& e0 != e6
& e1 != e2
& e1 != e3
& e1 != e4
& e1 != e5
& e1 != e6
& e2 != e3
& e2 != e4
& e2 != e5
& e2 != e6
& e3 != e4
& e3 != e5
& e3 != e6
& e4 != e5
& e4 != e6
& e5 != e6 ),
file('/tmp/tmpyuiEdf/sel_ALG199+1.p_1',ax5) ).
fof(7,conjecture,
~ ( op(e0,e0) != e0
& op(e1,e1) != e1
& op(e2,e2) != e2
& op(e3,e3) != e3
& op(e4,e4) != e4
& op(e5,e5) != e5
& op(e6,e6) != e6
& ( op(e0,e0) = e0
| op(e1,e1) = e1
| op(e2,e2) = e2
| op(e3,e3) = e3
| op(e4,e4) = e4
| op(e5,e5) = e5
| op(e6,e6) = e6 )
& ( op(e0,e0) != e0
| op(e1,e1) != e1
| op(e2,e2) != e2
| op(e3,e3) != e3
| op(e4,e4) != e4
| op(e5,e5) != e5
| op(e6,e6) != e6 ) ),
file('/tmp/tmpyuiEdf/sel_ALG199+1.p_1',co1) ).
fof(8,negated_conjecture,
~ ~ ( op(e0,e0) != e0
& op(e1,e1) != e1
& op(e2,e2) != e2
& op(e3,e3) != e3
& op(e4,e4) != e4
& op(e5,e5) != e5
& op(e6,e6) != e6
& ( op(e0,e0) = e0
| op(e1,e1) = e1
| op(e2,e2) = e2
| op(e3,e3) = e3
| op(e4,e4) = e4
| op(e5,e5) = e5
| op(e6,e6) = e6 )
& ( op(e0,e0) != e0
| op(e1,e1) != e1
| op(e2,e2) != e2
| op(e3,e3) != e3
| op(e4,e4) != e4
| op(e5,e5) != e5
| op(e6,e6) != e6 ) ),
inference(assume_negation,[status(cth)],[7]) ).
cnf(206,plain,
e4 = op(e5,op(e5,e5)),
inference(split_conjunct,[status(thm)],[4]) ).
cnf(208,plain,
e2 = op(op(e5,op(e5,e5)),op(e5,op(e5,e5))),
inference(split_conjunct,[status(thm)],[4]) ).
cnf(209,plain,
e1 = op(e5,e5),
inference(split_conjunct,[status(thm)],[4]) ).
cnf(513,plain,
e2 != e4,
inference(split_conjunct,[status(thm)],[6]) ).
cnf(516,plain,
e1 != e5,
inference(split_conjunct,[status(thm)],[6]) ).
fof(526,negated_conjecture,
( op(e0,e0) != e0
& op(e1,e1) != e1
& op(e2,e2) != e2
& op(e3,e3) != e3
& op(e4,e4) != e4
& op(e5,e5) != e5
& op(e6,e6) != e6
& ( op(e0,e0) = e0
| op(e1,e1) = e1
| op(e2,e2) = e2
| op(e3,e3) = e3
| op(e4,e4) = e4
| op(e5,e5) = e5
| op(e6,e6) = e6 )
& ( op(e0,e0) != e0
| op(e1,e1) != e1
| op(e2,e2) != e2
| op(e3,e3) != e3
| op(e4,e4) != e4
| op(e5,e5) != e5
| op(e6,e6) != e6 ) ),
inference(fof_nnf,[status(thm)],[8]) ).
cnf(528,negated_conjecture,
( op(e6,e6) = e6
| op(e5,e5) = e5
| op(e4,e4) = e4
| op(e3,e3) = e3
| op(e2,e2) = e2
| op(e1,e1) = e1
| op(e0,e0) = e0 ),
inference(split_conjunct,[status(thm)],[526]) ).
cnf(529,negated_conjecture,
op(e6,e6) != e6,
inference(split_conjunct,[status(thm)],[526]) ).
cnf(532,negated_conjecture,
op(e3,e3) != e3,
inference(split_conjunct,[status(thm)],[526]) ).
cnf(533,negated_conjecture,
op(e2,e2) != e2,
inference(split_conjunct,[status(thm)],[526]) ).
cnf(534,negated_conjecture,
op(e1,e1) != e1,
inference(split_conjunct,[status(thm)],[526]) ).
cnf(535,negated_conjecture,
op(e0,e0) != e0,
inference(split_conjunct,[status(thm)],[526]) ).
cnf(536,plain,
op(e5,e1) = e4,
inference(rw,[status(thm)],[206,209,theory(equality)]) ).
cnf(540,plain,
op(e4,e4) = e2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[208,209,theory(equality)]),536,theory(equality)]),209,theory(equality)]),536,theory(equality)]) ).
cnf(587,negated_conjecture,
( op(e0,e0) = e0
| op(e1,e1) = e1
| op(e2,e2) = e2
| op(e3,e3) = e3
| e2 = e4
| op(e5,e5) = e5
| op(e6,e6) = e6 ),
inference(rw,[status(thm)],[528,540,theory(equality)]) ).
cnf(588,negated_conjecture,
( op(e0,e0) = e0
| op(e1,e1) = e1
| op(e2,e2) = e2
| op(e3,e3) = e3
| e2 = e4
| e1 = e5
| op(e6,e6) = e6 ),
inference(rw,[status(thm)],[587,209,theory(equality)]) ).
cnf(589,negated_conjecture,
( op(e1,e1) = e1
| op(e2,e2) = e2
| op(e3,e3) = e3
| e2 = e4
| e1 = e5
| op(e6,e6) = e6 ),
inference(sr,[status(thm)],[588,535,theory(equality)]) ).
cnf(590,negated_conjecture,
( op(e2,e2) = e2
| op(e3,e3) = e3
| e2 = e4
| e1 = e5
| op(e6,e6) = e6 ),
inference(sr,[status(thm)],[589,534,theory(equality)]) ).
cnf(591,negated_conjecture,
( op(e3,e3) = e3
| e2 = e4
| e1 = e5
| op(e6,e6) = e6 ),
inference(sr,[status(thm)],[590,533,theory(equality)]) ).
cnf(592,negated_conjecture,
( e2 = e4
| e1 = e5
| op(e6,e6) = e6 ),
inference(sr,[status(thm)],[591,532,theory(equality)]) ).
cnf(593,negated_conjecture,
( e1 = e5
| op(e6,e6) = e6 ),
inference(sr,[status(thm)],[592,513,theory(equality)]) ).
cnf(594,negated_conjecture,
op(e6,e6) = e6,
inference(sr,[status(thm)],[593,516,theory(equality)]) ).
cnf(595,negated_conjecture,
$false,
inference(sr,[status(thm)],[594,529,theory(equality)]) ).
cnf(596,negated_conjecture,
$false,
595,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/ALG/ALG199+1.p
% --creating new selector for []
% -running prover on /tmp/tmpyuiEdf/sel_ALG199+1.p_1 with time limit 29
% -prover status Theorem
% Problem ALG199+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/ALG/ALG199+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/ALG/ALG199+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
%
%------------------------------------------------------------------------------