↑ Up

FindProof---0.1.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SWV008-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 : n002.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 35.60s 5.92s
% Output   : Proof 35.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   37 (  20 unt;   0 def)
%            Number of atoms       :   71 (   7 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   68 (  34   ~;  34   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-1 aty)
%            Number of variables   :   20 (   0 sgn  10   !;   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(f12,negated_conjecture,
    ~ less_than(n,l),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).

fof(f12_nnf,plain,
    ~ less_than(n,l),
    inference(nnf_transformation,[status(thm)],[f12]) ).

fof(f12_sk,plain,
    ~ less_than(n,l),
    inference(skolemisation,[status(esa)],[f12_nnf]) ).

cnf(c12,plain,
    ~ less_than(n,l),
    inference(cnf_transformation,[status(esa)],[f12_sk]) ).

cnf(p39,plain,
    ( n = l
    | less_than(l,n) ),
    inference(resolution,[status(thm)],[c7,c12]) ).

cnf(f16,negated_conjecture,
    ( ~ less_than(a(X),a(predecessor(X)))
    | ~ less_than(X,n)
    | ~ less_than(one,X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).

fof(f16_nnf,plain,
    ! [X] :
      ( ~ less_than(a(X),a(predecessor(X)))
      | ~ less_than(X,n)
      | ~ less_than(one,X) ),
    inference(nnf_transformation,[status(thm)],[f16]) ).

fof(f16_sk,plain,
    ! [X] :
      ( ~ less_than(a(X),a(predecessor(X)))
      | ~ less_than(X,n)
      | ~ less_than(one,X) ),
    inference(skolemisation,[status(esa)],[f16_nnf]) ).

cnf(c16,plain,
    ( ~ less_than(a(X0),a(predecessor(X0)))
    | ~ less_than(X0,n)
    | ~ less_than(one,X0) ),
    inference(cnf_transformation,[status(esa)],[f16_sk]) ).

cnf(f13,negated_conjecture,
    less_than(one,l),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).

fof(f13_nnf,plain,
    less_than(one,l),
    inference(nnf_transformation,[status(thm)],[f13]) ).

cnf(c13,plain,
    less_than(one,l),
    inference(cnf_transformation,[status(esa)],[f13_nnf]) ).

cnf(p17,plain,
    ( ~ less_than(a(l),a(predecessor(l)))
    | ~ less_than(l,n) ),
    inference(resolution,[status(thm)],[c16,c13]) ).

cnf(p60,plain,
    ( ~ less_than(a(l),a(predecessor(l)))
    | n = l ),
    inference(resolution,[status(thm)],[p39,p17]) ).

cnf(f14,negated_conjecture,
    less_than(a(l),a(predecessor(l))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

fof(f14_nnf,plain,
    less_than(a(l),a(predecessor(l))),
    inference(nnf_transformation,[status(thm)],[f14]) ).

cnf(c14,plain,
    less_than(a(l),a(predecessor(l))),
    inference(cnf_transformation,[status(esa)],[f14_nnf]) ).

cnf(p85,plain,
    n = l,
    inference(resolution,[status(thm)],[p60,c14]) ).

cnf(p86,plain,
    less_than(one,n),
    inference(superposition,[status(thm)],[p85,c13]) ).

cnf(f15,negated_conjecture,
    ( ~ less_than(a(X),a(predecessor(n)))
    | ~ less_than(one,n)
    | less_than(n,X)
    | less_than(X,n) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_4) ).

fof(f15_nnf,plain,
    ! [X] :
      ( ~ less_than(a(X),a(predecessor(n)))
      | ~ less_than(one,n)
      | less_than(n,X)
      | less_than(X,n) ),
    inference(nnf_transformation,[status(thm)],[f15]) ).

fof(f15_sk,plain,
    ! [X] :
      ( ~ less_than(a(X),a(predecessor(n)))
      | ~ less_than(one,n)
      | less_than(n,X)
      | less_than(X,n) ),
    inference(skolemisation,[status(esa)],[f15_nnf]) ).

cnf(c15,plain,
    ( ~ less_than(a(X0),a(predecessor(n)))
    | ~ less_than(one,n)
    | less_than(n,X0)
    | less_than(X0,n) ),
    inference(cnf_transformation,[status(esa)],[f15_sk]) ).

cnf(p18,plain,
    ( ~ less_than(a(n),a(predecessor(n)))
    | ~ less_than(one,n)
    | less_than(n,n) ),
    inference(factoring,[status(thm)],[c15]) ).

cnf(p112,plain,
    ( ~ less_than(a(n),a(predecessor(n)))
    | less_than(n,n) ),
    inference(resolution,[status(thm)],[p86,p18]) ).

cnf(p87,plain,
    less_than(a(n),a(predecessor(l))),
    inference(superposition,[status(thm)],[p85,c14]) ).

cnf(p192,plain,
    less_than(a(n),a(predecessor(n))),
    inference(superposition,[status(thm)],[p85,p87]) ).

cnf(p453,plain,
    less_than(n,n),
    inference(resolution,[status(thm)],[p112,p192]) ).

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(p454,plain,
    $false,
    inference(resolution,[status(thm)],[p453,c8]) ).

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