↑ Up

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

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

% 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 : Sun Sep 27 09:14:56 AM UTC 2026

% Result   : Theorem 0.07s 0.38s
% Output   : CNFRefutation 0.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   19 (  10 unt;   0 def)
%            Number of atoms       :   30 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   21 (  10   ~;   6   |;   1   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-1 aty)
%            Number of variables   :   12 (   4 sgn   5   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ax46,axiom,
    ! [VAR_V_35] :
      ( pred_attacker(tuple_T_out_4(VAR_V_35))
     => pred_attacker(VAR_V_35) ),
    file('theBenchmark.p',ax46) ).

fof(ax49,axiom,
    ! [VAR_V_44] :
      ( pred_attacker(VAR_V_44)
     => pred_attacker(tuple_T_in_3(VAR_V_44)) ),
    file('theBenchmark.p',ax49) ).

fof(ax51,axiom,
    ! [VAR_V_50X30] :
      ( pred_attacker(VAR_V_50X30)
     => pred_attacker(tuple_T_in_1(VAR_V_50X30)) ),
    file('theBenchmark.p',ax51) ).

fof(ax64,axiom,
    ! [VAR_K_XOR_K1_10X305,VAR_R1_10X306] :
      ( ( pred_attacker(tuple_T_in_1(VAR_R1_10X306))
        & pred_attacker(tuple_T_in_3(VAR_K_XOR_K1_10X305)) )
     => pred_attacker(tuple_T_out_4(name_objective)) ),
    file('theBenchmark.p',ax64) ).

fof(co0,conjecture,
    pred_attacker(name_objective),
    file('theBenchmark.p',co0) ).

fof(co0_neg,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(assume_negation,[status(cth)],[co0]) ).

fof(ax44,axiom,
    pred_attacker(constr_ZERO),
    file('theBenchmark.p',ax44) ).

cnf(c_99,plain,
    pred_attacker(constr_ZERO),
    inference(clausify,[status(thm)],[ax44]) ).

cnf(c_101,plain,
    ( pred_attacker(A)
    | ~ pred_attacker(tuple_T_out_4(A)) ),
    inference(clausify,[status(thm)],[ax46]) ).

cnf(c_104,plain,
    ( pred_attacker(tuple_T_in_3(A))
    | ~ pred_attacker(A) ),
    inference(clausify,[status(thm)],[ax49]) ).

cnf(c_106,plain,
    ( pred_attacker(tuple_T_in_1(A))
    | ~ pred_attacker(A) ),
    inference(clausify,[status(thm)],[ax51]) ).

cnf(c_116,plain,
    ( pred_attacker(tuple_T_out_4(name_objective))
    | ~ pred_attacker(tuple_T_in_1(B))
    | ~ pred_attacker(tuple_T_in_3(A)) ),
    inference(clausify,[status(thm)],[ax64]) ).

cnf(c_117,negated_conjecture,
    ~ pred_attacker(name_objective),
    inference(clausify,[status(thm)],[co0_neg]) ).

cnf(c_134,plain,
    pred_attacker(tuple_T_in_3(constr_ZERO)),
    inference(resolve,[status(thm)],[c_104,c_99]) ).

cnf(c_214,negated_conjecture,
    ~ pred_attacker(tuple_T_out_4(name_objective)),
    inference(resolve,[status(thm)],[c_101,c_117]) ).

cnf(c_434,plain,
    pred_attacker(tuple_T_in_1(tuple_T_in_3(constr_ZERO))),
    inference(resolve,[status(thm)],[c_106,c_134]) ).

cnf(c_460,plain,
    ( pred_attacker(tuple_T_out_4(name_objective))
    | ~ pred_attacker(tuple_T_in_1(A)) ),
    inference(resolve,[status(thm)],[c_116,c_134]) ).

cnf(c_458,plain,
    ~ pred_attacker(tuple_T_in_1(A)),
    inference(resolve,[status(thm)],[c_460,c_214]) ).

cnf(c_459,plain,
    $false,
    inference(resolve,[status(thm)],[c_458,c_434]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWW951+1 : TPTP v9.3.1. Released v7.4.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.34  % Computer : n002.cluster.edu
% 0.07/0.34  % Model    : x86_64 x86_64
% 0.07/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34  % Memory   : 8046.5625MB
% 0.07/0.34  % OS       : Linux 6.8.0-71-generic
% 0.07/0.34  % CPULimit : 300
% 0.07/0.34  % WCLimit  : 300
% 0.07/0.34  % DateTime : Sat Sep 26 16:40:05 UTC 2026
% 0.07/0.34  % CPUTime  : 
% 0.07/0.34  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.07/0.34  % Process 2204858 was started by sandbox2 on n002,
% 0.07/0.34  % Sat Sep 26 16:40:05 2026
% 0.07/0.34  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.07/0.35  
% 0.07/0.35  % From the command line: assign(max_seconds, 300).
% 0.07/0.38  
% 0.07/0.38  % SZS status Theorem for theBenchmark
% 0.07/0.38  
% 0.07/0.38  % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.07/0.38  % Length of proof is 16.
% 0.07/0.38  % Level of proof is 4.
% 0.07/0.38  % Maximum clause weight is 19.000.
% 0.07/0.38  % Given clauses 86.
% 0.07/0.38  
% 0.07/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------