↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SWV002-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 : n001.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:10:59 PM UTC 2026

% Result   : Unsatisfiable 73.95s 9.99s
% Output   : Proof 73.95s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   38 (  22 unt;   0 def)
%            Number of atoms       :   67 (   8 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   59 (  30   ~;  29   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-1 aty)
%            Number of variables   :   29 (   0 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(f7,axiom,
    ( X = Y
    | less_than(Y,X)
    | less_than(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',all_related) ).

fof(f7_nnf,plain,
    ! [X,Y] :
      ( X = Y
      | less_than(Y,X)
      | less_than(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f7]) ).

fof(f7_sk,plain,
    ! [X,Y] :
      ( X = Y
      | less_than(Y,X)
      | less_than(X,Y) ),
    inference(skolemisation,[status(esa)],[f7_nnf]) ).

cnf(c7,plain,
    ( X0 = X1
    | less_than(X1,X0)
    | less_than(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f7_sk]) ).

cnf(f21,negated_conjecture,
    ~ less_than(j,q),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_10) ).

fof(f21_nnf,plain,
    ~ less_than(j,q),
    inference(nnf_transformation,[status(thm)],[f21]) ).

fof(f21_sk,plain,
    ~ less_than(j,q),
    inference(skolemisation,[status(esa)],[f21_nnf]) ).

cnf(c21,plain,
    ~ less_than(j,q),
    inference(cnf_transformation,[status(esa)],[f21_sk]) ).

cnf(p50,plain,
    ( j = q
    | less_than(q,j) ),
    inference(resolution,[status(thm)],[c7,c21]) ).

cnf(f17,negated_conjecture,
    ( ~ less_than(a(X),a(k))
    | ~ less_than(X,j)
    | less_than(X,i) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).

fof(f17_nnf,plain,
    ! [X] :
      ( ~ less_than(a(X),a(k))
      | ~ less_than(X,j)
      | less_than(X,i) ),
    inference(nnf_transformation,[status(thm)],[f17]) ).

fof(f17_sk,plain,
    ! [X] :
      ( ~ less_than(a(X),a(k))
      | ~ less_than(X,j)
      | less_than(X,i) ),
    inference(skolemisation,[status(esa)],[f17_nnf]) ).

cnf(c17,plain,
    ( ~ less_than(a(X0),a(k))
    | ~ less_than(X0,j)
    | less_than(X0,i) ),
    inference(cnf_transformation,[status(esa)],[f17_sk]) ).

cnf(p79,plain,
    ( ~ less_than(a(q),a(k))
    | less_than(q,i)
    | j = q ),
    inference(resolution,[status(thm)],[p50,c17]) ).

cnf(f6,axiom,
    ( ~ less_than(Y,Z)
    | ~ less_than(X,Y)
    | less_than(X,Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_less_than) ).

fof(f6_nnf,plain,
    ! [X,Z,Y] :
      ( ~ less_than(Y,Z)
      | ~ less_than(X,Y)
      | less_than(X,Z) ),
    inference(nnf_transformation,[status(thm)],[f6]) ).

fof(f6_sk,plain,
    ! [X,Z,Y] :
      ( ~ less_than(Y,Z)
      | ~ less_than(X,Y)
      | less_than(X,Z) ),
    inference(skolemisation,[status(esa)],[f6_nnf]) ).

cnf(c6,plain,
    ( ~ less_than(X2,X1)
    | ~ less_than(X0,X2)
    | less_than(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f6_sk]) ).

cnf(f22,negated_conjecture,
    less_than(a(q),a(j)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).

fof(f22_nnf,plain,
    less_than(a(q),a(j)),
    inference(nnf_transformation,[status(thm)],[f22]) ).

cnf(c22,plain,
    less_than(a(q),a(j)),
    inference(cnf_transformation,[status(esa)],[f22_nnf]) ).

cnf(p38,plain,
    ( ~ less_than(a(j),X0)
    | less_than(a(q),X0) ),
    inference(resolution,[status(thm)],[c6,c22]) ).

cnf(f16,negated_conjecture,
    less_than(a(j),a(k)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).

fof(f16_nnf,plain,
    less_than(a(j),a(k)),
    inference(nnf_transformation,[status(thm)],[f16]) ).

cnf(c16,plain,
    less_than(a(j),a(k)),
    inference(cnf_transformation,[status(esa)],[f16_nnf]) ).

cnf(p104,plain,
    less_than(a(q),a(k)),
    inference(resolution,[status(thm)],[p38,c16]) ).

cnf(p646,plain,
    ( less_than(q,i)
    | j = q ),
    inference(resolution,[status(thm)],[p79,p104]) ).

cnf(f20,negated_conjecture,
    ~ less_than(q,i),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).

fof(f20_nnf,plain,
    ~ less_than(q,i),
    inference(nnf_transformation,[status(thm)],[f20]) ).

fof(f20_sk,plain,
    ~ less_than(q,i),
    inference(skolemisation,[status(esa)],[f20_nnf]) ).

cnf(c20,plain,
    ~ less_than(q,i),
    inference(cnf_transformation,[status(esa)],[f20_sk]) ).

cnf(p647,plain,
    j = q,
    inference(resolution,[status(thm)],[p646,c20]) ).

cnf(p649,plain,
    less_than(a(j),a(j)),
    inference(superposition,[status(thm)],[p647,c22]) ).

cnf(f8,axiom,
    ~ less_than(X,X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x_not_less_than_x) ).

fof(f8_nnf,plain,
    ! [X] : ~ less_than(X,X),
    inference(nnf_transformation,[status(thm)],[f8]) ).

fof(f8_sk,plain,
    ! [X] : ~ less_than(X,X),
    inference(skolemisation,[status(esa)],[f8_nnf]) ).

cnf(c8,plain,
    ~ less_than(X0,X0),
    inference(cnf_transformation,[status(esa)],[f8_sk]) ).

cnf(p663,plain,
    $false,
    inference(resolution,[status(thm)],[p649,c8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV002-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/0.58  % Computer : n001.cluster.edu
% 0.11/0.58  % Model    : x86_64 x86_64
% 0.11/0.58  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.58  % Memory   : 8046.5625MB
% 0.11/0.58  % OS       : Linux 6.8.0-71-generic
% 0.11/0.58  % CPULimit : 300
% 0.11/0.58  % WCLimit  : 300
% 0.11/0.58  % DateTime : Thu Sep 24 18:21:54 UTC 2026
% 0.11/0.58  % CPUTime  : 
% 0.11/0.58  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 73.95/9.99  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 73.95/9.99  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------