↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SYN105-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox/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 09:37:03 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(rule_001,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ n0(VAR_1,VAR_0)
      | k1(VAR_0) ),
    file('theBenchmark.p',rule_001) ).

cnf(c_1,plain,
    ( ~ n0(B,A)
    | k1(A) ),
    inference(clausify,[status(thm)],[rule_001]) ).

fof(axiom_15,axiom,
    n0(a,b),
    file('theBenchmark.p',axiom_15) ).

cnf(c_6,plain,
    n0(a,b),
    inference(clausify,[status(thm)],[axiom_15]) ).

cnf(c_259,plain,
    k1(b),
    inference(resolve,[status(thm)],[c_1,c_6]) ).

fof(prove_this,axiom,
    ~ k1(b),
    file('theBenchmark.p',prove_this) ).

cnf(c_264,plain,
    ~ k1(b),
    inference(clausify,[status(thm)],[prove_this]) ).

cnf(c_265,plain,
    $false,
    inference(resolve,[status(thm)],[c_259,c_264]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN105-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.34  % Computer : n012.cluster.edu
% 0.08/0.34  % Model    : x86_64 x86_64
% 0.08/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34  % Memory   : 8046.5625MB
% 0.08/0.34  % OS       : Linux 6.8.0-71-generic
% 0.08/0.34  % CPULimit : 300
% 0.08/0.34  % WCLimit  : 300
% 0.08/0.34  % DateTime : Sat Sep 26 17:11:05 UTC 2026
% 0.08/0.34  % CPUTime  : 
% 0.08/0.34  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.34  % Process 1118437 was started by sandbox on n012,
% 0.08/0.34  % Sat Sep 26 17:11:05 2026
% 0.08/0.34  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.13/0.35  
% 0.13/0.35  % From the command line: assign(max_seconds, 300).
% 0.13/0.47  
% 0.13/0.47  % SZS status Unsatisfiable for theBenchmark
% 0.13/0.47  
% 0.13/0.47  % Proof 1 at 0.11 (+ 0.00) seconds.
% 0.13/0.47  % Length of proof is 5.
% 0.13/0.47  % Level of proof is 2.
% 0.13/0.47  % Maximum clause weight is 7.000.
% 0.13/0.47  % Given clauses 0.
% 0.13/0.47  
% 0.13/0.47  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------