↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SYN079+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 : n014.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:33:45 PM UTC 2026

% Result   : Theorem 3.46s 0.82s
% Output   : Proof 3.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   23 (  19 unt;   0 def)
%            Number of atoms       :   31 (   7 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   20 (  12   ~;   6   |;   1   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 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-4 aty)
%            Number of variables   :   15 (   0 sgn   9   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X,Y,Z] :
      ( ( big_f(Y,Z)
        & big_f(X,Y) )
     => big_f(X,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel57_3) ).

fof(f2_nnf,plain,
    ! [X,Y,Z] :
      ( big_f(X,Z)
      | ~ big_f(Y,Z)
      | ~ big_f(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [X,Y,Z] :
      ( big_f(X,Z)
      | ~ big_f(Y,Z)
      | ~ big_f(X,Y) ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c2,plain,
    ( big_f(X0,X2)
    | ~ big_f(X1,X2)
    | ~ big_f(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(hi2,axiom,
    ifeq(big_f(X0,X1),true,ifeq(big_f(X1,X2),true,big_f(X0,X2),true),true) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

fof(f0,axiom,
    big_f(f(a,b),f(b,c)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel57_1) ).

fof(f0_nnf,plain,
    big_f(f(a,b),f(b,c)),
    inference(nnf_transformation,[status(thm)],[f0]) ).

cnf(c0,plain,
    big_f(f(a,b),f(b,c)),
    inference(cnf_transformation,[status(esa)],[f0_nnf]) ).

cnf(hi0,axiom,
    big_f(f(a,b),f(b,c)) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

fof(f1,axiom,
    big_f(f(b,c),f(a,c)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel57_2) ).

fof(f1_nnf,plain,
    big_f(f(b,c),f(a,c)),
    inference(nnf_transformation,[status(thm)],[f1]) ).

cnf(c1,plain,
    big_f(f(b,c),f(a,c)),
    inference(cnf_transformation,[status(esa)],[f1_nnf]) ).

cnf(hi1,axiom,
    big_f(f(b,c),f(a,c)) = true,
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(t1,plain,
    big_f(f(a,b),f(a,c)) = true,
    inference(hyper_resolution,[status(thm)],[hi2,hi0,hi1]) ).

cnf(t6,plain,
    big_f(f(a,b),f(a,c)) = true,
    inference(orient,[status(thm)],[t1]) ).

fof(f3,conjecture,
    big_f(f(a,b),f(a,c)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel57) ).

fof(f3_neg,negated_conjecture,
    ~ big_f(f(a,b),f(a,c)),
    inference(negated_conjecture,[status(cth)],[f3]) ).

fof(f3_nnf,plain,
    ~ big_f(f(a,b),f(a,c)),
    inference(nnf_transformation,[status(thm)],[f3_neg]) ).

fof(f3_sk,plain,
    ~ big_f(f(a,b),f(a,c)),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    ~ big_f(f(a,b),f(a,c)),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(goal_0,negated_conjecture,
    big_f(f(a,b),f(a,c)) != true,
    inference(equality_encoding,[status(esa)],[c3]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN079+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.35  % Computer : n014.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Fri Sep 25 00:07:17 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.35  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.46/0.82  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.46/0.82  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------