↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : CSR018+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/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 01:05:12 PM UTC 2026

% Result   : Theorem 23.65s 3.83s
% Output   : Proof 23.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   63 (  25 unt;   0 def)
%            Number of atoms       :  224 ( 111 equ)
%            Maximal formula atoms :   20 (   3 avg)
%            Number of connectives :  256 (  95   ~;  96   |;  58   &)
%                                         (   6 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   8 con; 0-2 aty)
%            Number of variables   :   70 (   1 sgn  44   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f15,axiom,
    ! [Event,Time] :
      ( happens(Event,Time)
    <=> ( ( Time = n2
          & Event = push )
        | ( Time = n2
          & Event = pull )
        | ( Time = n1
          & Event = pull )
        | ( Time = n0
          & Event = push ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',happens_all_defn) ).

fof(f15_nnf,plain,
    ! [Event,Time] :
      ( ( ( ( Time != n2
            | Event != push )
          & ( Time != n2
            | Event != pull )
          & ( Time != n1
            | Event != pull )
          & ( Time != n0
            | Event != push ) )
        | happens(Event,Time) )
      & ( ( Time = n2
          & Event = push )
        | ( Time = n2
          & Event = pull )
        | ( Time = n1
          & Event = pull )
        | ( Time = n0
          & Event = push )
        | ~ happens(Event,Time) ) ),
    inference(nnf_transformation,[status(thm)],[f15]) ).

fof(f15_sk,plain,
    ! [Event,Time] :
      ( ( ( ( Time != n2
            | Event != push )
          & ( Time != n2
            | Event != pull )
          & ( Time != n1
            | Event != pull )
          & ( Time != n0
            | Event != push ) )
        | happens(Event,Time) )
      & ( ( Time = n2
          & Event = push )
        | ( Time = n2
          & Event = pull )
        | ( Time = n1
          & Event = pull )
        | ( Time = n0
          & Event = push )
        | ~ happens(Event,Time) ) ),
    inference(skolemisation,[status(esa)],[f15_nnf]) ).

cnf(c177,plain,
    ( X1 = n2
    | X0 = pull
    | X0 = pull
    | X1 = n0
    | ~ happens(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f15_sk]) ).

cnf(p570,plain,
    ( X1 = n2
    | X0 = pull
    | X1 = n0
    | ~ happens(X0,X1) ),
    inference(factoring,[status(thm)],[c177]) ).

fof(f12,axiom,
    ! [Event,Fluent,Time] :
      ( initiates(Event,Fluent,Time)
    <=> ( ( happens(push,Time)
          & Fluent = spinning
          & Event = pull )
        | ( ~ happens(push,Time)
          & Fluent = backwards
          & Event = pull )
        | ( ~ happens(pull,Time)
          & Fluent = forwards
          & Event = push ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',initiates_all_defn) ).

fof(f12_nnf,plain,
    ! [Event,Fluent,Time] :
      ( ( ( ( ~ happens(push,Time)
            | Fluent != spinning
            | Event != pull )
          & ( happens(push,Time)
            | Fluent != backwards
            | Event != pull )
          & ( happens(pull,Time)
            | Fluent != forwards
            | Event != push ) )
        | initiates(Event,Fluent,Time) )
      & ( ( happens(push,Time)
          & Fluent = spinning
          & Event = pull )
        | ( ~ happens(push,Time)
          & Fluent = backwards
          & Event = pull )
        | ( ~ happens(pull,Time)
          & Fluent = forwards
          & Event = push )
        | ~ initiates(Event,Fluent,Time) ) ),
    inference(nnf_transformation,[status(thm)],[f12]) ).

fof(f12_sk,plain,
    ! [Event,Fluent,Time] :
      ( ( ( ( ~ happens(push,Time)
            | Fluent != spinning
            | Event != pull )
          & ( happens(push,Time)
            | Fluent != backwards
            | Event != pull )
          & ( happens(pull,Time)
            | Fluent != forwards
            | Event != push ) )
        | initiates(Event,Fluent,Time) )
      & ( ( happens(push,Time)
          & Fluent = spinning
          & Event = pull )
        | ( ~ happens(push,Time)
          & Fluent = backwards
          & Event = pull )
        | ( ~ happens(pull,Time)
          & Fluent = forwards
          & Event = push )
        | ~ initiates(Event,Fluent,Time) ) ),
    inference(skolemisation,[status(esa)],[f12_nnf]) ).

cnf(c53,plain,
    ( happens(push,X2)
    | X1 != backwards
    | X0 != pull
    | initiates(X0,X1,X2) ),
    inference(cnf_transformation,[status(esa)],[f12_sk]) ).

cnf(p390,plain,
    ( happens(push,X1)
    | X0 != backwards
    | initiates(pull,X0,X1) ),
    inference(equality_resolution,[status(thm)],[c53]) ).

cnf(p811,plain,
    ( happens(push,X0)
    | initiates(pull,backwards,X0) ),
    inference(equality_resolution,[status(thm)],[p390]) ).

cnf(c185,plain,
    ( X1 != n1
    | X0 != pull
    | happens(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f15_sk]) ).

cnf(p533,plain,
    ( X0 != n1
    | happens(pull,X0) ),
    inference(equality_resolution,[status(thm)],[c185]) ).

cnf(p535,plain,
    happens(pull,n1),
    inference(equality_resolution,[status(thm)],[p533]) ).

fof(f8,axiom,
    ! [Event,Time,Fluent] :
      ( ( initiates(Event,Fluent,Time)
        & happens(Event,Time) )
     => holdsAt(Fluent,plus(Time,n1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',happens_holds) ).

fof(f8_nnf,plain,
    ! [Event,Time,Fluent] :
      ( holdsAt(Fluent,plus(Time,n1))
      | ~ initiates(Event,Fluent,Time)
      | ~ happens(Event,Time) ),
    inference(nnf_transformation,[status(thm)],[f8]) ).

fof(f8_sk,plain,
    ! [Event,Time,Fluent] :
      ( holdsAt(Fluent,plus(Time,n1))
      | ~ initiates(Event,Fluent,Time)
      | ~ happens(Event,Time) ),
    inference(skolemisation,[status(esa)],[f8_nnf]) ).

cnf(c20,plain,
    ( holdsAt(X2,plus(X1,n1))
    | ~ initiates(X0,X2,X1)
    | ~ happens(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f8_sk]) ).

cnf(p541,plain,
    ( holdsAt(X0,n2)
    | ~ initiates(pull,X0,n1) ),
    inference(resolution,[status(thm)],[p535,c20]) ).

cnf(p812,plain,
    ( holdsAt(backwards,n2)
    | happens(push,n1) ),
    inference(resolution,[status(thm)],[p811,p541]) ).

fof(f47,conjecture,
    holdsAt(backwards,n2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',backwards_2) ).

fof(f47_neg,negated_conjecture,
    ~ holdsAt(backwards,n2),
    inference(negated_conjecture,[status(cth)],[f47]) ).

fof(f47_nnf,plain,
    ~ holdsAt(backwards,n2),
    inference(nnf_transformation,[status(thm)],[f47_neg]) ).

fof(f47_sk,plain,
    ~ holdsAt(backwards,n2),
    inference(skolemisation,[status(esa)],[f47_nnf]) ).

cnf(c232,plain,
    ~ holdsAt(backwards,n2),
    inference(cnf_transformation,[status(esa)],[f47_sk]) ).

cnf(p813,plain,
    happens(push,n1),
    inference(resolution,[status(thm)],[p812,c232]) ).

cnf(p926,plain,
    ( n1 = n2
    | push = pull
    | n1 = n0 ),
    inference(resolution,[status(thm)],[p570,p813]) ).

fof(f16,axiom,
    push != pull,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',push_not_pull) ).

fof(f16_nnf,plain,
    push != pull,
    inference(nnf_transformation,[status(thm)],[f16]) ).

fof(f16_sk,plain,
    push != pull,
    inference(skolemisation,[status(esa)],[f16_nnf]) ).

cnf(c188,plain,
    push != pull,
    inference(cnf_transformation,[status(esa)],[f16_sk]) ).

cnf(p1173,plain,
    ( n1 = n2
    | n1 = n0 ),
    inference(resolution,[status(thm)],[p926,c188]) ).

fof(f22,axiom,
    plus(n0,n2) = n2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus0_2) ).

fof(f22_nnf,plain,
    plus(n0,n2) = n2,
    inference(nnf_transformation,[status(thm)],[f22]) ).

cnf(c194,plain,
    plus(n0,n2) = n2,
    inference(cnf_transformation,[status(esa)],[f22_nnf]) ).

cnf(p1178,plain,
    ( n2 = n1
    | n1 = n0 ),
    inference(superposition,[status(thm)],[p1173,c194]) ).

fof(f42,axiom,
    ! [X,Y] :
      ( less(X,Y)
    <=> ( Y != X
        & ~ less(Y,X) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_property) ).

fof(f42_nnf,plain,
    ! [X,Y] :
      ( ( Y = X
        | less(Y,X)
        | less(X,Y) )
      & ( ( Y != X
          & ~ less(Y,X) )
        | ~ less(X,Y) ) ),
    inference(nnf_transformation,[status(thm)],[f42]) ).

fof(f42_sk,plain,
    ! [X,Y] :
      ( ( Y = X
        | less(Y,X)
        | less(X,Y) )
      & ( ( Y != X
          & ~ less(Y,X) )
        | ~ less(X,Y) ) ),
    inference(skolemisation,[status(esa)],[f42_nnf]) ).

cnf(c226,plain,
    ( X1 != X0
    | ~ less(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f42_sk]) ).

fof(f34,axiom,
    ! [X] :
      ( less(X,n2)
    <=> less_or_equal(X,n1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less2) ).

fof(f34_nnf,plain,
    ! [X] :
      ( ( ~ less_or_equal(X,n1)
        | less(X,n2) )
      & ( less_or_equal(X,n1)
        | ~ less(X,n2) ) ),
    inference(nnf_transformation,[status(thm)],[f34]) ).

fof(f34_sk,plain,
    ! [X] :
      ( ( ~ less_or_equal(X,n1)
        | less(X,n2) )
      & ( less_or_equal(X,n1)
        | ~ less(X,n2) ) ),
    inference(skolemisation,[status(esa)],[f34_nnf]) ).

cnf(c210,plain,
    ( ~ less_or_equal(X0,n1)
    | less(X0,n2) ),
    inference(cnf_transformation,[status(esa)],[f34_sk]) ).

fof(f31,axiom,
    ! [X,Y] :
      ( less_or_equal(X,Y)
    <=> ( X = Y
        | less(X,Y) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal) ).

fof(f31_nnf,plain,
    ! [X,Y] :
      ( ( ( X != Y
          & ~ less(X,Y) )
        | less_or_equal(X,Y) )
      & ( X = Y
        | less(X,Y)
        | ~ less_or_equal(X,Y) ) ),
    inference(nnf_transformation,[status(thm)],[f31]) ).

fof(f31_sk,plain,
    ! [X,Y] :
      ( ( ( X != Y
          & ~ less(X,Y) )
        | less_or_equal(X,Y) )
      & ( X = Y
        | less(X,Y)
        | ~ less_or_equal(X,Y) ) ),
    inference(skolemisation,[status(esa)],[f31_nnf]) ).

cnf(c205,plain,
    ( X0 != X1
    | less_or_equal(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f31_sk]) ).

cnf(p235,plain,
    less_or_equal(X0,X0),
    inference(equality_resolution,[status(thm)],[c205]) ).

cnf(p239,plain,
    less(n1,n2),
    inference(resolution,[status(thm)],[c210,p235]) ).

cnf(p399,plain,
    n2 != n1,
    inference(resolution,[status(thm)],[c226,p239]) ).

cnf(p1217,plain,
    n1 = n0,
    inference(resolution,[status(thm)],[p1178,p399]) ).

fof(f33,axiom,
    ! [X] :
      ( less(X,n1)
    <=> less_or_equal(X,n0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less1) ).

fof(f33_nnf,plain,
    ! [X] :
      ( ( ~ less_or_equal(X,n0)
        | less(X,n1) )
      & ( less_or_equal(X,n0)
        | ~ less(X,n1) ) ),
    inference(nnf_transformation,[status(thm)],[f33]) ).

fof(f33_sk,plain,
    ! [X] :
      ( ( ~ less_or_equal(X,n0)
        | less(X,n1) )
      & ( less_or_equal(X,n0)
        | ~ less(X,n1) ) ),
    inference(skolemisation,[status(esa)],[f33_nnf]) ).

cnf(c208,plain,
    ( ~ less_or_equal(X0,n0)
    | less(X0,n1) ),
    inference(cnf_transformation,[status(esa)],[f33_sk]) ).

cnf(p237,plain,
    less(n0,n1),
    inference(resolution,[status(thm)],[c208,p235]) ).

cnf(p1231,plain,
    less(n0,n0),
    inference(demodulation,[status(thm)],[p1217,p237]) ).

fof(f32,axiom,
    ~ ? [X] : less(X,n0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less0) ).

fof(f32_nnf,plain,
    ! [X] : ~ less(X,n0),
    inference(nnf_transformation,[status(thm)],[f32]) ).

fof(f32_sk,plain,
    ! [X] : ~ less(X,n0),
    inference(skolemisation,[status(esa)],[f32_nnf]) ).

cnf(c206,plain,
    ~ less(X0,n0),
    inference(cnf_transformation,[status(esa)],[f32_sk]) ).

cnf(p1292,plain,
    $false,
    inference(resolution,[status(thm)],[p1231,c206]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR018+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.37  % Computer : n001.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Fri Sep 25 08:13:10 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 23.65/3.83  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 23.65/3.83  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------