↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SYN287-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 : n016.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:28 AM UTC 2026

% Result   : Unsatisfiable 0.34s 15.53s
% Output   : CNFRefutation 0.34s
% 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-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :    8 (   3 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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]) ).

fof(rule_100,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ n0(VAR_1,VAR_0)
      | q1(VAR_0,VAR_0,VAR_0) ),
    file('theBenchmark.p',rule_100) ).

cnf(c_22,plain,
    ( ~ n0(B,A)
    | q1(A,A,A) ),
    inference(clausify,[status(thm)],[rule_100]) ).

cnf(c_222,plain,
    q1(b,b,b),
    inference(resolve,[status(thm)],[c_22,c_6]) ).

fof(prove_this,axiom,
    ! [VAR_0,VAR_1] : ~ q1(b,VAR_0,VAR_1),
    file('theBenchmark.p',prove_this) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN287-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.09/5.38   % Computer : n016.cluster.edu
% 0.09/5.38   % Model    : x86_64 x86_64
% 0.09/5.38   % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38   % Memory   : 8046.5625MB
% 0.09/5.38   % OS       : Linux 6.8.0-71-generic
% 0.08/15.42  % CPULimit : 300
% 0.08/15.42  % WCLimit  : 300
% 0.08/15.42  % DateTime : Sat Sep 26 17:30:35 UTC 2026
% 0.08/15.43  % CPUTime  : 
% 0.08/15.43  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/15.43  % Process 3807535 was started by sandbox on n010,
% 0.08/15.43  % Sat Sep 26 17:30:35 2026
% 0.08/15.43  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.08/15.44  
% 0.08/15.44  % From the command line: assign(max_seconds, 300).
% 0.34/15.53  
% 0.34/15.53  % SZS status Unsatisfiable for theBenchmark
% 0.34/15.53  
% 0.34/15.53  % Proof 1 at 0.08 (+ 0.00) seconds.
% 0.34/15.53  % Length of proof is 5.
% 0.34/15.53  % Level of proof is 2.
% 0.34/15.53  % Maximum clause weight is 9.000.
% 0.34/15.53  % Given clauses 0.
% 0.34/15.53  
% 0.34/15.53  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------