↑ Up

Prover9---2026-6A.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : CSR023+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n012.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 : Sun Sep 27 07:06:33 AM UTC 2026

% Result   : Theorem 0.13s 5.47s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   33 (  19 unt;   0 def)
%            Number of atoms       :   69 (  32 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   57 (  21   ~;  22   |;  11   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   10 (  10 usr;   9 con; 0-2 aty)
%            Number of variables   :   27 (   0 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(happens_holds,axiom,
    ! [Event,Time,Fluent] :
      ( ( initiates(Event,Fluent,Time)
        & happens(Event,Time) )
     => holdsAt(Fluent,plus(Time,n1)) ),
    file('theBenchmark.p',happens_holds) ).

fof(initiates_all_defn,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('theBenchmark.p',initiates_all_defn) ).

fof(happens_all_defn,axiom,
    ! [Event,Time] :
      ( happens(Event,Time)
    <=> ( ( Time = n2
          & Event = push )
        | ( Time = n2
          & Event = pull )
        | ( Time = n1
          & Event = pull )
        | ( Time = n0
          & Event = push ) ) ),
    file('theBenchmark.p',happens_all_defn) ).

fof(symmetry_of_plus,axiom,
    ! [X,Y] : plus(X,Y) = plus(Y,X),
    file('theBenchmark.p',symmetry_of_plus) ).

fof(spinning_3,conjecture,
    holdsAt(spinning,n3),
    file('theBenchmark.p',spinning_3) ).

fof(spinning_3_neg,negated_conjecture,
    ~ holdsAt(spinning,n3),
    inference(assume_negation,[status(cth)],[spinning_3]) ).

cnf(c_51,negated_conjecture,
    ~ holdsAt(spinning,n3),
    inference(clausify,[status(thm)],[spinning_3_neg]) ).

cnf(c_81,plain,
    plus(A,B) = plus(B,A),
    inference(clausify,[status(thm)],[symmetry_of_plus]) ).

fof(plus1_2,axiom,
    plus(n1,n2) = n3,
    file('theBenchmark.p',plus1_2) ).

cnf(c_86,plain,
    plus(n1,n2) = n3,
    inference(clausify,[status(thm)],[plus1_2]) ).

fof(plus0_2,axiom,
    plus(n0,n2) = n2,
    file('theBenchmark.p',plus0_2) ).

cnf(c_89,plain,
    plus(n0,n2) = n2,
    inference(clausify,[status(thm)],[plus0_2]) ).

cnf(c_90,plain,
    plus(n2,n0) = n2,
    inference(paramod,[status(thm)],[c_81,c_89]) ).

cnf(c_99,plain,
    ( n2 != B
    | push != A
    | happens(A,B) ),
    inference(clausify,[status(thm)],[happens_all_defn]) ).

cnf(c_100,plain,
    ( n2 != B
    | pull != A
    | happens(A,B) ),
    inference(clausify,[status(thm)],[happens_all_defn]) ).

cnf(c_121,plain,
    ( ~ happens(push,C)
    | spinning != B
    | pull != A
    | initiates(A,B,C) ),
    inference(clausify,[status(thm)],[initiates_all_defn]) ).

cnf(c_137,plain,
    ( holdsAt(C,plus(B,n1))
    | ~ initiates(A,C,B)
    | ~ happens(A,B) ),
    inference(clausify,[status(thm)],[happens_holds]) ).

cnf(c_418,plain,
    ( n2 != A
    | happens(push,A) ),
    inference(xxres,[status(thm)],[c_99]) ).

cnf(c_419,plain,
    n2 = plus(n2,n0),
    inference(copy,[status(thm)],[c_90]) ).

cnf(c_420,plain,
    happens(push,plus(n2,n0)),
    inference(resolve,[status(thm)],[c_418,c_419]) ).

cnf(c_175,plain,
    happens(push,n2),
    inference(paramod,[status(thm)],[c_90,c_420]) ).

cnf(c_421,plain,
    ( n2 != A
    | happens(pull,A) ),
    inference(xxres,[status(thm)],[c_100]) ).

cnf(c_422,plain,
    n2 = plus(n2,n0),
    inference(copy,[status(thm)],[c_90]) ).

cnf(c_423,plain,
    happens(pull,plus(n2,n0)),
    inference(resolve,[status(thm)],[c_421,c_422]) ).

cnf(c_178,plain,
    happens(pull,n2),
    inference(paramod,[status(thm)],[c_90,c_423]) ).

cnf(c_424,plain,
    ( ~ happens(push,B)
    | spinning != A
    | initiates(pull,A,B) ),
    inference(xxres,[status(thm)],[c_121]) ).

cnf(c_425,plain,
    ( ~ happens(push,A)
    | initiates(pull,spinning,A) ),
    inference(xxres,[status(thm)],[c_424]) ).

cnf(c_219,plain,
    initiates(pull,spinning,n2),
    inference(resolve,[status(thm)],[c_425,c_175]) ).

cnf(c_426,plain,
    ( holdsAt(spinning,plus(n2,n1))
    | ~ happens(pull,n2) ),
    inference(resolve,[status(thm)],[c_219,c_137]) ).

cnf(c_427,plain,
    ( holdsAt(spinning,plus(n1,n2))
    | ~ happens(pull,n2) ),
    inference(paramod,[status(thm)],[c_81,c_426]) ).

cnf(c_428,plain,
    ( holdsAt(spinning,n3)
    | ~ happens(pull,n2) ),
    inference(paramod,[status(thm)],[c_86,c_427]) ).

cnf(c_429,plain,
    holdsAt(spinning,n3),
    inference(resolve,[status(thm)],[c_178,c_428]) ).

cnf(c_417,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_51,c_429]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : CSR023+1 : TPTP v9.3.1. Bugfixed v3.1.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/5.37  % Computer : n012.cluster.edu
% 0.09/5.37  % Model    : x86_64 x86_64
% 0.09/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.37  % Memory   : 8046.5625MB
% 0.09/5.37  % OS       : Linux 6.8.0-71-generic
% 0.09/5.37  % CPULimit : 300
% 0.09/5.37  % WCLimit  : 300
% 0.09/5.37  % DateTime : Sat Sep 26 23:56:25 UTC 2026
% 0.09/5.38  % CPUTime  : 
% 0.09/5.38  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/5.38  % Process 1787485 was started by sandbox2 on n012,
% 0.09/5.38  % Sat Sep 26 23:56:25 2026
% 0.09/5.38  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/5.39  
% 0.09/5.39  % From the command line: assign(max_seconds, 300).
% 0.13/5.47  
% 0.13/5.47  % SZS status Theorem for theBenchmark
% 0.13/5.47  
% 0.13/5.47  % Proof 1 at 0.05 (+ 0.02) seconds.
% 0.13/5.47  % Length of proof is 18.
% 0.13/5.47  % Level of proof is 5.
% 0.13/5.47  % Maximum clause weight is 22.000.
% 0.13/5.47  % Given clauses 293.
% 0.13/5.47  
% 0.13/5.47  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------