TSTP Solution File: KLE075+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : KLE075+1 : TPTP v5.0.0. Released v4.0.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 : Sat Dec 25 12:11:46 EST 2010
% Result : Theorem 0.20s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 18 ( 18 unt; 0 def)
% Number of atoms : 18 ( 15 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn 8 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/tmp/tmpICs8PJ/sel_KLE075+1.p_1',multiplicative_left_identity) ).
fof(9,axiom,
! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
file('/tmp/tmpICs8PJ/sel_KLE075+1.p_1',domain2) ).
fof(13,conjecture,
! [X4] : domain(multiplication(one,domain(X4))) = domain(X4),
file('/tmp/tmpICs8PJ/sel_KLE075+1.p_1',goals) ).
fof(14,negated_conjecture,
~ ! [X4] : domain(multiplication(one,domain(X4))) = domain(X4),
inference(assume_negation,[status(cth)],[13]) ).
fof(15,plain,
! [X2] : multiplication(one,X2) = X2,
inference(variable_rename,[status(thm)],[1]) ).
cnf(16,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[15]) ).
fof(31,plain,
! [X6,X7] : domain(multiplication(X6,X7)) = domain(multiplication(X6,domain(X7))),
inference(variable_rename,[status(thm)],[9]) ).
cnf(32,plain,
domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[31]) ).
fof(39,negated_conjecture,
? [X4] : domain(multiplication(one,domain(X4))) != domain(X4),
inference(fof_nnf,[status(thm)],[14]) ).
fof(40,negated_conjecture,
? [X5] : domain(multiplication(one,domain(X5))) != domain(X5),
inference(variable_rename,[status(thm)],[39]) ).
fof(41,negated_conjecture,
domain(multiplication(one,domain(esk1_0))) != domain(esk1_0),
inference(skolemize,[status(esa)],[40]) ).
cnf(42,negated_conjecture,
domain(multiplication(one,domain(esk1_0))) != domain(esk1_0),
inference(split_conjunct,[status(thm)],[41]) ).
cnf(43,negated_conjecture,
domain(domain(esk1_0)) != domain(esk1_0),
inference(rw,[status(thm)],[42,16,theory(equality)]) ).
cnf(55,plain,
domain(domain(X1)) = domain(multiplication(one,X1)),
inference(spm,[status(thm)],[32,16,theory(equality)]) ).
cnf(59,plain,
domain(domain(X1)) = domain(X1),
inference(rw,[status(thm)],[55,16,theory(equality)]) ).
cnf(171,negated_conjecture,
$false,
inference(rw,[status(thm)],[43,59,theory(equality)]) ).
cnf(172,negated_conjecture,
$false,
inference(cn,[status(thm)],[171,theory(equality)]) ).
cnf(173,negated_conjecture,
$false,
172,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/KLE/KLE075+1.p
% --creating new selector for [KLE001+0.ax, KLE001+5.ax]
% -running prover on /tmp/tmpICs8PJ/sel_KLE075+1.p_1 with time limit 29
% -prover status Theorem
% Problem KLE075+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/KLE/KLE075+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/KLE/KLE075+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
%
%------------------------------------------------------------------------------