↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SWV007-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 : n004.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:11:00 PM UTC 2026

% Result   : Unsatisfiable 44.94s 11.14s
% Output   : Proof 44.94s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   43 (  21 unt;   0 def)
%            Number of atoms       :   82 (   7 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   70 (  31   ~;  39   |;   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    :    7 (   7 usr;   4 con; 0-1 aty)
%            Number of variables   :   43 (   0 sgn  20   !;   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(f22,negated_conjecture,
    ( ~ less_than(a(X),a(k))
    | ~ less_than(X,successor(n))
    | less_than(X,i) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).

fof(f22_nnf,plain,
    ! [X] :
      ( ~ less_than(a(X),a(k))
      | ~ less_than(X,successor(n))
      | less_than(X,i) ),
    inference(nnf_transformation,[status(thm)],[f22]) ).

fof(f22_sk,plain,
    ! [X] :
      ( ~ less_than(a(X),a(k))
      | ~ less_than(X,successor(n))
      | less_than(X,i) ),
    inference(skolemisation,[status(esa)],[f22_nnf]) ).

cnf(c22,plain,
    ( ~ less_than(a(X0),a(k))
    | ~ less_than(X0,successor(n))
    | less_than(X0,i) ),
    inference(cnf_transformation,[status(esa)],[f22_sk]) ).

cnf(p54,plain,
    ( ~ less_than(a(X0),a(k))
    | less_than(X0,i)
    | X0 = successor(n)
    | less_than(successor(n),X0) ),
    inference(resolution,[status(thm)],[c7,c22]) ).

cnf(f19,negated_conjecture,
    less_than(a(m),a(k)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).

fof(f19_nnf,plain,
    less_than(a(m),a(k)),
    inference(nnf_transformation,[status(thm)],[f19]) ).

cnf(c19,plain,
    less_than(a(m),a(k)),
    inference(cnf_transformation,[status(esa)],[f19_nnf]) ).

cnf(p191,plain,
    ( less_than(m,i)
    | m = successor(n)
    | less_than(successor(n),m) ),
    inference(resolution,[status(thm)],[p54,c19]) ).

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(f4,axiom,
    less_than(predecessor(X),X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',predecessor_less_than) ).

fof(f4_nnf,plain,
    ! [X] : less_than(predecessor(X),X),
    inference(nnf_transformation,[status(thm)],[f4]) ).

fof(f4_sk,plain,
    ! [X] : less_than(predecessor(X),X),
    inference(skolemisation,[status(esa)],[f4_nnf]) ).

cnf(c4,plain,
    less_than(predecessor(X0),X0),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(p38,plain,
    ( ~ less_than(X0,X1)
    | less_than(predecessor(X0),X1) ),
    inference(resolution,[status(thm)],[c6,c4]) ).

cnf(p1503,plain,
    ( less_than(n,m)
    | less_than(m,i)
    | m = successor(n) ),
    inference(resolution,[status(thm)],[p191,p38]) ).

cnf(f5,axiom,
    less_than(X,successor(X)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_than_successor) ).

fof(f5_nnf,plain,
    ! [X] : less_than(X,successor(X)),
    inference(nnf_transformation,[status(thm)],[f5]) ).

fof(f5_sk,plain,
    ! [X] : less_than(X,successor(X)),
    inference(skolemisation,[status(esa)],[f5_nnf]) ).

cnf(c5,plain,
    less_than(X0,successor(X0)),
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

cnf(p8622,plain,
    ( less_than(n,m)
    | less_than(n,m)
    | less_than(m,i) ),
    inference(superposition,[status(thm)],[p1503,c5]) ).

cnf(p8764,plain,
    ( less_than(n,m)
    | less_than(m,i) ),
    inference(factoring,[status(thm)],[p8622]) ).

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

fof(f9_nnf,plain,
    ! [X,Y] :
      ( ~ less_than(Y,X)
      | ~ less_than(X,Y) ),
    inference(nnf_transformation,[status(thm)],[f9]) ).

fof(f9_sk,plain,
    ! [X,Y] :
      ( ~ less_than(Y,X)
      | ~ less_than(X,Y) ),
    inference(skolemisation,[status(esa)],[f9_nnf]) ).

cnf(c9,plain,
    ( ~ less_than(X1,X0)
    | ~ less_than(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f9_sk]) ).

cnf(f16,negated_conjecture,
    less_than(i,m),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).

fof(f16_nnf,plain,
    less_than(i,m),
    inference(nnf_transformation,[status(thm)],[f16]) ).

cnf(c16,plain,
    less_than(i,m),
    inference(cnf_transformation,[status(esa)],[f16_nnf]) ).

cnf(p31,plain,
    ~ less_than(m,i),
    inference(resolution,[status(thm)],[c9,c16]) ).

cnf(p8766,plain,
    less_than(n,m),
    inference(resolution,[status(thm)],[p8764,p31]) ).

cnf(f15,negated_conjecture,
    ~ less_than(n,m),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).

fof(f15_nnf,plain,
    ~ less_than(n,m),
    inference(nnf_transformation,[status(thm)],[f15]) ).

fof(f15_sk,plain,
    ~ less_than(n,m),
    inference(skolemisation,[status(esa)],[f15_nnf]) ).

cnf(c15,plain,
    ~ less_than(n,m),
    inference(cnf_transformation,[status(esa)],[f15_sk]) ).

cnf(p8767,plain,
    $false,
    inference(resolution,[status(thm)],[p8766,c15]) ).

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