↑ Up

FindProof---0.1.UNS-Prf.s

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

% Computer : n019.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:09 PM UTC 2026

% Result   : Unsatisfiable 4.94s 1.40s
% Output   : Proof 4.94s
% 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 :   22 (  14   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-4 aty)
%            Number of variables   :   27 (  11 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f52,axiom,
    ( ~ m0(C,C,B)
    | ~ l0(D)
    | m1(B,C,C) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_015) ).

fof(f52_nnf,plain,
    ! [B,C,D] :
      ( ~ m0(C,C,B)
      | ~ l0(D)
      | m1(B,C,C) ),
    inference(nnf_transformation,[status(thm)],[f52]) ).

fof(f52_sk,plain,
    ! [B,C,D] :
      ( ~ m0(C,C,B)
      | ~ l0(D)
      | m1(B,C,C) ),
    inference(skolemisation,[status(esa)],[f52_nnf]) ).

cnf(c52,plain,
    ( ~ m0(X1,X1,X0)
    | ~ l0(X2)
    | m1(X0,X1,X1) ),
    inference(cnf_transformation,[status(esa)],[f52_sk]) ).

cnf(hi52,axiom,
    ifeq(l0(X0),true,ifeq(m0(X1,X1,X2),true,m1(X2,X1,X1),true),true) = true,
    inference(equality_encoding,[status(esa)],[c52]) ).

cnf(f23,axiom,
    l0(c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_24) ).

fof(f23_nnf,plain,
    l0(c),
    inference(nnf_transformation,[status(thm)],[f23]) ).

cnf(c23,plain,
    l0(c),
    inference(cnf_transformation,[status(esa)],[f23_nnf]) ).

cnf(hi23,axiom,
    l0(c) = true,
    inference(equality_encoding,[status(esa)],[c23]) ).

cnf(f18,axiom,
    m0(X,d,Y),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_19) ).

fof(f18_nnf,plain,
    ! [X,Y] : m0(X,d,Y),
    inference(nnf_transformation,[status(thm)],[f18]) ).

fof(f18_sk,plain,
    ! [X,Y] : m0(X,d,Y),
    inference(skolemisation,[status(esa)],[f18_nnf]) ).

cnf(c18,plain,
    m0(X0,d,X1),
    inference(cnf_transformation,[status(esa)],[f18_sk]) ).

cnf(hi18,axiom,
    m0(X0,d,X1) = true,
    inference(equality_encoding,[status(esa)],[c18]) ).

cnf(t1,plain,
    m1(X1,d,d) = true,
    inference(hyper_resolution,[status(thm)],[hi52,hi23,hi18]) ).

cnf(t73,plain,
    m1(X1,d,d) = true,
    inference(orient,[status(thm)],[t1]) ).

cnf(f368,negated_conjecture,
    ~ m1(a,d,d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f368_nnf,plain,
    ~ m1(a,d,d),
    inference(nnf_transformation,[status(thm)],[f368]) ).

fof(f368_sk,plain,
    ~ m1(a,d,d),
    inference(skolemisation,[status(esa)],[f368_nnf]) ).

cnf(c368,plain,
    ~ m1(a,d,d),
    inference(cnf_transformation,[status(esa)],[f368_sk]) ).

cnf(goal_0,negated_conjecture,
    m1(a,d,d) != true,
    inference(equality_encoding,[status(esa)],[c368]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN243-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.36  % Computer : n019.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Fri Sep 25 00:36:33 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.94/1.40  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.94/1.40  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------