↑ Up

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

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

% Computer : n015.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 09:06:51 AM UTC 2026

% Result   : Theorem 0.14s 5.49s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    6 (   4 unt;   0 def)
%            Number of atoms       :   52 (  14 equ)
%            Maximal formula atoms :   24 (   8 avg)
%            Number of connectives :   48 (   2   ~;   0   |;  34   &)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;  14 con; 0-3 aty)
%            Number of variables   :   16 (   0 sgn  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(thruster_inuse_0001,conjecture,
    ( ( ! [G,H] :
          ( ( leq(H,minus(n_steps,n1))
            & leq(G,minus(m_measvars,n1))
            & leq(n0,H)
            & leq(n0,G) )
         => a_select3(z_defuse,G,H) = use )
      & ! [F] :
          ( ( leq(F,minus(n_statevars,n1))
            & leq(n0,F) )
         => a_select2(xinit_mean_defuse,F) = use )
      & ! [E] :
          ( ( leq(E,minus(n_statevars,n1))
            & leq(n0,E) )
         => a_select2(xinit_defuse,E) = use )
      & ! [C,D] :
          ( ( leq(D,minus(n_steps,n1))
            & leq(C,n7)
            & leq(n0,D)
            & leq(n0,C) )
         => a_select3(tr_defuse,C,D) = use )
      & ! [A,B] :
          ( ( leq(B,minus(n_steps,n1))
            & leq(A,minus(m_measvars,n1))
            & leq(n0,B)
            & leq(n0,A) )
         => a_select3(rho_defuse,A,B) = use )
      & tvar_defuse = use
      & t_defuse = use )
   => true ),
    file('theBenchmark.p',thruster_inuse_0001) ).

fof(thruster_inuse_0001_neg,negated_conjecture,
    ~ ( ( ! [G,H] :
            ( ( leq(H,minus(n_steps,n1))
              & leq(G,minus(m_measvars,n1))
              & leq(n0,H)
              & leq(n0,G) )
           => a_select3(z_defuse,G,H) = use )
        & ! [F] :
            ( ( leq(F,minus(n_statevars,n1))
              & leq(n0,F) )
           => a_select2(xinit_mean_defuse,F) = use )
        & ! [E] :
            ( ( leq(E,minus(n_statevars,n1))
              & leq(n0,E) )
           => a_select2(xinit_defuse,E) = use )
        & ! [C,D] :
            ( ( leq(D,minus(n_steps,n1))
              & leq(C,n7)
              & leq(n0,D)
              & leq(n0,C) )
           => a_select3(tr_defuse,C,D) = use )
        & ! [A,B] :
            ( ( leq(B,minus(n_steps,n1))
              & leq(A,minus(m_measvars,n1))
              & leq(n0,B)
              & leq(n0,A) )
           => a_select3(rho_defuse,A,B) = use )
        & tvar_defuse = use
        & t_defuse = use )
     => true ),
    inference(assume_negation,[status(cth)],[thruster_inuse_0001]) ).

fof(ttrue,axiom,
    true,
    file('theBenchmark.p',ttrue) ).

cnf(c_321,plain,
    true,
    inference(clausify,[status(thm)],[ttrue]) ).

cnf(c_369,negated_conjecture,
    ~ true,
    inference(clausify,[status(thm)],[thruster_inuse_0001_neg]) ).

cnf(c_370,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_321,c_369]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV128+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.03  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/5.37  % Computer : n015.cluster.edu
% 0.10/5.37  % Model    : x86_64 x86_64
% 0.10/5.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37  % Memory   : 8046.5625MB
% 0.10/5.37  % OS       : Linux 6.8.0-71-generic
% 0.10/5.37  % CPULimit : 300
% 0.10/5.37  % WCLimit  : 300
% 0.10/5.37  % DateTime : Sat Sep 26 13:17:49 UTC 2026
% 0.10/5.37  % CPUTime  : 
% 0.10/5.38  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/5.38  % Process 4158369 was started by sandbox on n015,
% 0.10/5.38  % Sat Sep 26 13:17:49 2026
% 0.10/5.38  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.14/5.43  
% 0.14/5.43  % From the command line: assign(max_seconds, 300).
% 0.14/5.49  
% 0.14/5.49  % SZS status Theorem for theBenchmark
% 0.14/5.49  
% 0.14/5.49  % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.14/5.49  % Length of proof is 4.
% 0.14/5.49  % Level of proof is 2.
% 0.14/5.49  % Maximum clause weight is 1.000.
% 0.14/5.49  % Given clauses 0.
% 0.14/5.49  
% 0.14/5.49  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------