TSTP Solution File: ALG200+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : ALG200+1 : TPTP v5.0.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art07.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:41 EST 2010
% Result : Theorem 0.47s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of formulae : 20 ( 9 unt; 0 def)
% Number of atoms : 128 ( 98 equ)
% Maximal formula atoms : 21 ( 6 avg)
% Number of connectives : 160 ( 52 ~; 84 |; 24 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 2 ( 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(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/tmpJ7l0nY/sel_ALG200+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]) ).
fof(525,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(526,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)],[525]) ).
cnf(528,negated_conjecture,
op(e6,e6) = e6,
inference(split_conjunct,[status(thm)],[525]) ).
cnf(529,negated_conjecture,
op(e5,e5) = e5,
inference(split_conjunct,[status(thm)],[525]) ).
cnf(530,negated_conjecture,
op(e4,e4) = e4,
inference(split_conjunct,[status(thm)],[525]) ).
cnf(531,negated_conjecture,
op(e3,e3) = e3,
inference(split_conjunct,[status(thm)],[525]) ).
cnf(532,negated_conjecture,
op(e2,e2) = e2,
inference(split_conjunct,[status(thm)],[525]) ).
cnf(533,negated_conjecture,
op(e1,e1) = e1,
inference(split_conjunct,[status(thm)],[525]) ).
cnf(534,negated_conjecture,
op(e0,e0) = e0,
inference(split_conjunct,[status(thm)],[525]) ).
cnf(2844,negated_conjecture,
( $false
| 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(rw,[status(thm)],[526,534,theory(equality)]) ).
cnf(2845,negated_conjecture,
( $false
| $false
| op(e2,e2) != e2
| op(e3,e3) != e3
| op(e4,e4) != e4
| op(e5,e5) != e5
| op(e6,e6) != e6 ),
inference(rw,[status(thm)],[2844,533,theory(equality)]) ).
cnf(2846,negated_conjecture,
( $false
| $false
| $false
| op(e3,e3) != e3
| op(e4,e4) != e4
| op(e5,e5) != e5
| op(e6,e6) != e6 ),
inference(rw,[status(thm)],[2845,532,theory(equality)]) ).
cnf(2847,negated_conjecture,
( $false
| $false
| $false
| $false
| op(e4,e4) != e4
| op(e5,e5) != e5
| op(e6,e6) != e6 ),
inference(rw,[status(thm)],[2846,531,theory(equality)]) ).
cnf(2848,negated_conjecture,
( $false
| $false
| $false
| $false
| $false
| op(e5,e5) != e5
| op(e6,e6) != e6 ),
inference(rw,[status(thm)],[2847,530,theory(equality)]) ).
cnf(2849,negated_conjecture,
( $false
| $false
| $false
| $false
| $false
| $false
| op(e6,e6) != e6 ),
inference(rw,[status(thm)],[2848,529,theory(equality)]) ).
cnf(2850,negated_conjecture,
( $false
| $false
| $false
| $false
| $false
| $false
| $false ),
inference(rw,[status(thm)],[2849,528,theory(equality)]) ).
cnf(2851,negated_conjecture,
$false,
inference(cn,[status(thm)],[2850,theory(equality)]) ).
cnf(2852,negated_conjecture,
$false,
2851,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/ALG/ALG200+1.p
% --creating new selector for []
% -running prover on /tmp/tmpJ7l0nY/sel_ALG200+1.p_1 with time limit 29
% -prover status Theorem
% Problem ALG200+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/ALG/ALG200+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/ALG/ALG200+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
%
%------------------------------------------------------------------------------