↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SYN727+1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300

% Computer : n006.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep 25 03:35:34 PM UTC 2026

% Result   : Theorem 5.56s 1.18s
% Output   : Proof 5.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   21 (  16 unt;   0 def)
%            Number of atoms       :   34 (  13 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   22 (   9   ~;   3   |;   6   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-4 aty)
%            Number of variables   :   32 (   6 sgn  14   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f0,conjecture,
    ( ( ! [Y] :
          ( ? [Z] : likes(Y,Z)
         => likes(lyle,Y) )
      & ! [X] : likes(X,bruce) )
   => ? [U] :
      ! [V] : likes(U,V) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm68) ).

fof(f0_neg,negated_conjecture,
    ~ ( ( ! [Y] :
            ( ? [Z] : likes(Y,Z)
           => likes(lyle,Y) )
        & ! [X] : likes(X,bruce) )
     => ? [U] :
        ! [V] : likes(U,V) ),
    inference(negated_conjecture,[status(cth)],[f0]) ).

fof(f0_nnf,plain,
    ( ! [U] :
      ? [V] : ~ likes(U,V)
    & ! [Y] :
        ( likes(lyle,Y)
        | ! [Z] : ~ likes(Y,Z) )
    & ! [X] : likes(X,bruce) ),
    inference(nnf_transformation,[status(thm)],[f0_neg]) ).

fof(f0_sk,plain,
    ! [X,Y,Z,U] :
      ( ~ likes(U,sk0(U))
      & ( likes(lyle,Y)
        | ~ likes(Y,Z) )
      & likes(X,bruce) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).

cnf(c2,plain,
    ~ likes(X3,sk0(X3)),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(t4,plain,
    eq(likes(X1,sk0(X1)),true) = efalse,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(t11,plain,
    eq(likes(X1,sk0(X1)),true) = efalse,
    inference(orient,[status(thm)],[t4]) ).

cnf(c1,plain,
    ( likes(lyle,X1)
    | ~ likes(X1,X2) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(hi1,negated_conjecture,
    ifeq(likes(X0,X1),true,likes(lyle,X0),true) = true,
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(c0,plain,
    likes(X0,bruce),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(hi0,negated_conjecture,
    likes(X0,bruce) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(t2,plain,
    likes(lyle,X1) = true,
    inference(hyper_resolution,[status(thm)],[hi1,hi0]) ).

cnf(t8,plain,
    likes(lyle,X1) = true,
    inference(orient,[status(thm)],[t2]) ).

cnf(t12,plain,
    efalse = eq(true,true),
    inference(cp,[status(thm)],[t11,t8]) ).

cnf(t0,plain,
    eq(X1,X1) = etrue,
    introduced(definition) ).

cnf(t10,plain,
    eq(X1,X1) = etrue,
    inference(orient,[status(thm)],[t0]) ).

cnf(t17,plain,
    efalse = etrue,
    inference(step,[status(thm)],[t12,t10]) ).

cnf(t13,plain,
    efalse = etrue,
    inference(orient,[status(thm)],[t17]) ).

cnf(goal_0,negated_conjecture,
    etrue != efalse,
    introduced(definition) ).

cnf(g0_0,plain,
    etrue != etrue,
    inference(rw,[status(thm)],[goal_0,t13]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN727+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.37  % Computer : n006.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Fri Sep 25 02:11:56 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.56/1.18  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.56/1.18  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------