TSTP Solution File: CSR147+1 by SInE---0.4

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : CSR147+1 : TPTP v5.0.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : Source/sine.py -e eprover -t %d %s

% Computer : art11.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory   : 2006MB
% OS       : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sat Dec 25 08:07:59 EST 2010

% Result   : Theorem 0.20s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   31 (  19 unt;   0 def)
%            Number of atoms       :   73 (   2 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   79 (  37   ~;  38   |;   2   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-1 aty)
%            Number of variables   :   22 (   0 sgn   9   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(2,axiom,
    ~ s__has_seen_more(geoff,jim),
    file('/tmp/tmphLGZD_/sel_CSR147+1.p_1',jim_has_seen_more) ).

fof(3,axiom,
    s__Human(jim),
    file('/tmp/tmphLGZD_/sel_CSR147+1.p_1',jim_human) ).

fof(6,axiom,
    geoff = s__siblingFn(jim),
    file('/tmp/tmphLGZD_/sel_CSR147+1.p_1',geoff_and_jim) ).

fof(7,axiom,
    ! [X2,X3,X4] :
      ( s__Human(X2)
     => ( ( s__age(X2,X3)
          & s__age(s__siblingFn(X2),X4)
          & greater(X3,X4) )
       => ( s__more_experienced(X2,s__siblingFn(X2))
          | s__has_seen_more(s__siblingFn(X2),X2) ) ) ),
    file('/tmp/tmphLGZD_/sel_CSR147+1.p_1',experience) ).

fof(8,conjecture,
    s__more_experienced(jim,geoff),
    file('/tmp/tmphLGZD_/sel_CSR147+1.p_1',jim_is_experienced) ).

fof(9,axiom,
    s__age(jim,n54),
    file('/tmp/tmphLGZD_/sel_CSR147+1.p_1',jim_54) ).

fof(10,axiom,
    greater(n54,n48),
    file('/tmp/tmphLGZD_/sel_CSR147+1.p_1',greater_54_48) ).

fof(11,axiom,
    s__age(geoff,n48),
    file('/tmp/tmphLGZD_/sel_CSR147+1.p_1',geoff_48) ).

fof(15,negated_conjecture,
    ~ s__more_experienced(jim,geoff),
    inference(assume_negation,[status(cth)],[8]) ).

fof(16,plain,
    ~ s__has_seen_more(geoff,jim),
    inference(fof_simplification,[status(thm)],[2,theory(equality)]) ).

fof(17,negated_conjecture,
    ~ s__more_experienced(jim,geoff),
    inference(fof_simplification,[status(thm)],[15,theory(equality)]) ).

cnf(21,plain,
    ~ s__has_seen_more(geoff,jim),
    inference(split_conjunct,[status(thm)],[16]) ).

cnf(22,plain,
    s__Human(jim),
    inference(split_conjunct,[status(thm)],[3]) ).

cnf(29,plain,
    geoff = s__siblingFn(jim),
    inference(split_conjunct,[status(thm)],[6]) ).

fof(30,plain,
    ! [X2,X3,X4] :
      ( ~ s__Human(X2)
      | ~ s__age(X2,X3)
      | ~ s__age(s__siblingFn(X2),X4)
      | ~ greater(X3,X4)
      | s__more_experienced(X2,s__siblingFn(X2))
      | s__has_seen_more(s__siblingFn(X2),X2) ),
    inference(fof_nnf,[status(thm)],[7]) ).

fof(31,plain,
    ! [X5,X6,X7] :
      ( ~ s__Human(X5)
      | ~ s__age(X5,X6)
      | ~ s__age(s__siblingFn(X5),X7)
      | ~ greater(X6,X7)
      | s__more_experienced(X5,s__siblingFn(X5))
      | s__has_seen_more(s__siblingFn(X5),X5) ),
    inference(variable_rename,[status(thm)],[30]) ).

cnf(32,plain,
    ( s__has_seen_more(s__siblingFn(X1),X1)
    | s__more_experienced(X1,s__siblingFn(X1))
    | ~ greater(X2,X3)
    | ~ s__age(s__siblingFn(X1),X3)
    | ~ s__age(X1,X2)
    | ~ s__Human(X1) ),
    inference(split_conjunct,[status(thm)],[31]) ).

cnf(33,negated_conjecture,
    ~ s__more_experienced(jim,geoff),
    inference(split_conjunct,[status(thm)],[17]) ).

cnf(34,plain,
    s__age(jim,n54),
    inference(split_conjunct,[status(thm)],[9]) ).

cnf(35,plain,
    greater(n54,n48),
    inference(split_conjunct,[status(thm)],[10]) ).

cnf(36,plain,
    s__age(geoff,n48),
    inference(split_conjunct,[status(thm)],[11]) ).

cnf(52,plain,
    ( s__more_experienced(jim,geoff)
    | s__has_seen_more(geoff,jim)
    | ~ greater(X1,X2)
    | ~ s__age(geoff,X2)
    | ~ s__age(jim,X1)
    | ~ s__Human(jim) ),
    inference(spm,[status(thm)],[32,29,theory(equality)]) ).

cnf(53,plain,
    ( s__more_experienced(jim,geoff)
    | s__has_seen_more(geoff,jim)
    | ~ greater(X1,X2)
    | ~ s__age(geoff,X2)
    | ~ s__age(jim,X1)
    | $false ),
    inference(rw,[status(thm)],[52,22,theory(equality)]) ).

cnf(54,plain,
    ( s__more_experienced(jim,geoff)
    | s__has_seen_more(geoff,jim)
    | ~ greater(X1,X2)
    | ~ s__age(geoff,X2)
    | ~ s__age(jim,X1) ),
    inference(cn,[status(thm)],[53,theory(equality)]) ).

cnf(55,plain,
    ( s__has_seen_more(geoff,jim)
    | ~ greater(X1,X2)
    | ~ s__age(geoff,X2)
    | ~ s__age(jim,X1) ),
    inference(sr,[status(thm)],[54,33,theory(equality)]) ).

cnf(56,plain,
    ( ~ greater(X1,X2)
    | ~ s__age(geoff,X2)
    | ~ s__age(jim,X1) ),
    inference(sr,[status(thm)],[55,21,theory(equality)]) ).

cnf(89,plain,
    ( ~ s__age(geoff,n48)
    | ~ s__age(jim,n54) ),
    inference(spm,[status(thm)],[56,35,theory(equality)]) ).

cnf(90,plain,
    ( $false
    | ~ s__age(jim,n54) ),
    inference(rw,[status(thm)],[89,36,theory(equality)]) ).

cnf(91,plain,
    ( $false
    | $false ),
    inference(rw,[status(thm)],[90,34,theory(equality)]) ).

cnf(92,plain,
    $false,
    inference(cn,[status(thm)],[91,theory(equality)]) ).

cnf(93,plain,
    $false,
    92,
    [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/CSR/CSR147+1.p
% --creating new selector for []
% -running prover on /tmp/tmphLGZD_/sel_CSR147+1.p_1 with time limit 29
% -prover status Theorem
% Problem CSR147+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/CSR/CSR147+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/CSR/CSR147+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
% 
%------------------------------------------------------------------------------