↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n003.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:34:24 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f0,conjecture,
    ! [X] :
    ? [Y1,Y2] :
    ! [Z] :
      ( big_f(X,Z)
     => ( big_f(Y1,Z)
       => ( big_f(Y2,Z)
         => ( big_f(Y1,X)
           => big_f(Z,Y2) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_15_1) ).

fof(f0_neg,negated_conjecture,
    ~ ! [X] :
      ? [Y1,Y2] :
      ! [Z] :
        ( big_f(X,Z)
       => ( big_f(Y1,Z)
         => ( big_f(Y2,Z)
           => ( big_f(Y1,X)
             => big_f(Z,Y2) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f0]) ).

fof(f0_nnf,plain,
    ? [X] :
    ! [Y1,Y2] :
    ? [Z] :
      ( ~ big_f(Z,Y2)
      & big_f(Y1,X)
      & big_f(Y2,Z)
      & big_f(Y1,Z)
      & big_f(X,Z) ),
    inference(nnf_transformation,[status(thm)],[f0_neg]) ).

fof(f0_sk,plain,
    ! [Y1,Y2] :
      ( ~ big_f(sk1(Y1,Y2),Y2)
      & big_f(Y1,sk0)
      & big_f(Y2,sk1(Y1,Y2))
      & big_f(Y1,sk1(Y1,Y2))
      & big_f(sk0,sk1(Y1,Y2)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f0_nnf]) ).

cnf(c4,plain,
    ~ big_f(sk1(X1,X2),X2),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(t5,plain,
    eq(big_f(sk1(X1,X2),X2),true) = efalse,
    inference(equality_encoding,[status(esa)],[c4]) ).

cnf(t11,plain,
    eq(big_f(sk1(X1,X2),X2),true) = efalse,
    inference(orient,[status(thm)],[t5]) ).

cnf(c3,plain,
    big_f(X1,sk0),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(t0,plain,
    big_f(X1,sk0) = true,
    inference(equality_encoding,[status(esa)],[c3]) ).

cnf(t8,plain,
    big_f(X1,sk0) = true,
    inference(orient,[status(thm)],[t0]) ).

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

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

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

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

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

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  : SYN336+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.11/0.37  % Computer : n003.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Fri Sep 25 00:55:07 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.96/1.04  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.96/1.04  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------