↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SWV106+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 : n019.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:49 AM UTC 2026

% Result   : Theorem 0.24s 5.59s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    6 (   4 unt;   0 def)
%            Number of atoms       :   56 (  14 equ)
%            Maximal formula atoms :   26 (   9 avg)
%            Number of connectives :   52 (   2   ~;   0   |;  34   &)
%                                         (   0 <=>;  16  =>;   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   :   18 (   0 sgn  18   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(quaternion_ds1_inuse_0018,conjecture,
    ( ( ! [H,I] :
          ( ( leq(I,minus(n_steps,n1))
            & leq(H,minus(m_measvars,n1))
            & leq(n0,I)
            & leq(n0,H) )
         => a_select3(z_defuse,H,I) = use )
      & ! [G] :
          ( ( leq(G,minus(n_statevars,n1))
            & leq(n0,G) )
         => a_select2(xinit_noise_defuse,G) = 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,n2)
            & leq(n0,D)
            & leq(n0,C) )
         => a_select3(u_defuse,C,D) = use )
      & ! [B] :
          ( ( leq(B,minus(n_statevars,n1))
            & leq(n0,B) )
         => a_select2(sigma_defuse,B) = use )
      & ! [A] :
          ( ( leq(A,minus(m_measvars,n1))
            & leq(n0,A) )
         => a_select2(rho_defuse,A) = use ) )
   => true ),
    file('theBenchmark.p',quaternion_ds1_inuse_0018) ).

fof(quaternion_ds1_inuse_0018_neg,negated_conjecture,
    ~ ( ( ! [H,I] :
            ( ( leq(I,minus(n_steps,n1))
              & leq(H,minus(m_measvars,n1))
              & leq(n0,I)
              & leq(n0,H) )
           => a_select3(z_defuse,H,I) = use )
        & ! [G] :
            ( ( leq(G,minus(n_statevars,n1))
              & leq(n0,G) )
           => a_select2(xinit_noise_defuse,G) = 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,n2)
              & leq(n0,D)
              & leq(n0,C) )
           => a_select3(u_defuse,C,D) = use )
        & ! [B] :
            ( ( leq(B,minus(n_statevars,n1))
              & leq(n0,B) )
           => a_select2(sigma_defuse,B) = use )
        & ! [A] :
            ( ( leq(A,minus(m_measvars,n1))
              & leq(n0,A) )
           => a_select2(rho_defuse,A) = use ) )
     => true ),
    inference(assume_negation,[status(cth)],[quaternion_ds1_inuse_0018]) ).

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

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

cnf(c_373,negated_conjecture,
    ~ true,
    inference(clausify,[status(thm)],[quaternion_ds1_inuse_0018_neg]) ).

cnf(c_374,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_327,c_373]) ).

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