TSTP Solution File: SYO561+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYO561+1 : TPTP v5.3.0. Released v5.3.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 @ 2800MHz
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Nov 27 15:12:00 EST 2011
% Result : Theorem 0.15s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 5 ( 5 unt; 0 def)
% Number of atoms : 5 ( 1 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 0 usr; 2 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
~ equal("Apple","Microsoft"),
file('/tmp/tmpIgNXKz/sel_SYO561+1.p_1',apple_not_microsoft) ).
fof(2,negated_conjecture,
~ ~ equal("Apple","Microsoft"),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
equal("Apple","Microsoft"),
inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).
cnf(4,negated_conjecture,
"Apple" = "Microsoft",
inference(split_conjunct,[status(thm)],[3]) ).
cnf(5,negated_conjecture,
$false,
4,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/graph/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYO/SYO561+1.p
% --creating new selector for []
% -running prover on /tmp/tmpIgNXKz/sel_SYO561+1.p_1 with time limit 29
% -running prover with command ['/davis/home/graph/tptp/Systems/SInE---0.4/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/tmp/tmpIgNXKz/sel_SYO561+1.p_1']
% -prover status Theorem
% Problem SYO561+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYO/SYO561+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYO/SYO561+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
%
%------------------------------------------------------------------------------