↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n011.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:43 PM UTC 2026

% Result   : Unsatisfiable 3.26s 16.14s
% Output   : Proof 3.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   24 (  20 unt;   0 def)
%            Number of atoms       :   28 (  15 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   10 (   6   ~;   4   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   26 (   7 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f1,negated_conjecture,
    ~ big_f(X,f(X)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f1_nnf,plain,
    ! [X] : ~ big_f(X,f(X)),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [X] : ~ big_f(X,f(X)),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    ~ big_f(X0,f(X0)),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(t4,plain,
    big_f(X1,f(X1)) = false,
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(t11,plain,
    big_f(X1,f(X1)) = false,
    inference(orient,[status(thm)],[t4]) ).

cnf(f0,negated_conjecture,
    ( big_f(X,Y)
    | big_f(a,X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).

fof(f0_nnf,plain,
    ! [X,Y] :
      ( big_f(X,Y)
      | big_f(a,X) ),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [X,Y] :
      ( big_f(X,Y)
      | big_f(a,X) ),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    ( big_f(X0,X1)
    | big_f(a,X0) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(t5,plain,
    or(big_f(a,X1),big_f(X1,X2)) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(t10,plain,
    or(big_f(a,X1),big_f(X1,X2)) = true,
    inference(orient,[status(thm)],[t5]) ).

cnf(t13,plain,
    true = or(big_f(a,X1),false),
    inference(cp,[status(thm)],[t10,t11]) ).

cnf(t0,plain,
    or(X1,false) = X1,
    introduced(definition) ).

cnf(t6,plain,
    or(X1,false) = X1,
    inference(orient,[status(thm)],[t0]) ).

cnf(t21,plain,
    true = big_f(a,X1),
    inference(step,[status(thm)],[t13,t6]) ).

cnf(t14,plain,
    big_f(a,X1) = true,
    inference(orient,[status(thm)],[t21]) ).

cnf(t15,plain,
    true = false,
    inference(cp,[status(thm)],[t14,t11]) ).

cnf(t16,plain,
    false = true,
    inference(orient,[status(thm)],[t15]) ).

cnf(t22,plain,
    big_f(X1,f(X1)) = true,
    inference(step,[status(thm)],[t11,t16]) ).

cnf(t17,plain,
    big_f(X1,f(X1)) = true,
    inference(orient,[status(thm)],[t22]) ).

cnf(goal_0,negated_conjecture,
    big_f(X1,f(X1)) != true,
    inference(equality_encoding,[status(esa)],[c1]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN073-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.34   % Computer : n011.cluster.edu
% 0.08/0.34   % Model    : x86_64 x86_64
% 0.08/0.34   % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34   % Memory   : 8046.5625MB
% 0.08/0.34   % OS       : Linux 6.8.0-71-generic
% 0.07/15.42  % CPULimit : 300
% 0.07/15.42  % WCLimit  : 300
% 0.07/15.42  % DateTime : Fri Sep 25 00:05:07 UTC 2026
% 0.07/15.43  % CPUTime  : 
% 0.07/15.43  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.26/16.14  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.26/16.14  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------