↑ Up

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

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

% Computer : n004.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:36:56 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(clause_5,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( big_r(VAR_2,VAR_2)
      | ~ big_q(VAR_0,VAR_1) ),
    file('theBenchmark.p',clause_5) ).

cnf(c_1,plain,
    ( big_r(C,C)
    | ~ big_q(A,B) ),
    inference(clausify,[status(thm)],[clause_5]) ).

fof(clause_4,axiom,
    ! [VAR_0,VAR_1] :
      ( big_q(i(VAR_0,VAR_1),VAR_0)
      | big_p(VAR_0,VAR_1) ),
    file('theBenchmark.p',clause_4) ).

cnf(c_2,plain,
    ( big_q(i(A,B),A)
    | big_p(A,B) ),
    inference(clausify,[status(thm)],[clause_4]) ).

fof(clause_3,axiom,
    ! [VAR_0,VAR_1] :
      ( big_q(h(VAR_0,VAR_1),g(VAR_0))
      | ~ big_p(f(VAR_0,VAR_1),g(VAR_0)) ),
    file('theBenchmark.p',clause_3) ).

cnf(c_3,plain,
    ( big_q(h(A,B),g(A))
    | ~ big_p(f(A,B),g(A)) ),
    inference(clausify,[status(thm)],[clause_3]) ).

fof(clause_6,axiom,
    ! [VAR_0] : ~ big_r(a,VAR_0),
    file('theBenchmark.p',clause_6) ).

cnf(c_4,plain,
    ~ big_r(a,A),
    inference(clausify,[status(thm)],[clause_6]) ).

cnf(c_5,plain,
    ( big_p(B,C)
    | big_r(A,A) ),
    inference(resolve,[status(thm)],[c_1,c_2]) ).

cnf(c_6,plain,
    ( ~ big_p(f(B,C),g(B))
    | big_r(A,A) ),
    inference(resolve,[status(thm)],[c_1,c_3]) ).

cnf(c_7,plain,
    ~ big_p(f(A,B),g(A)),
    inference(resolve,[status(thm)],[c_4,c_6]) ).

cnf(c_8,plain,
    big_p(A,B),
    inference(resolve,[status(thm)],[c_4,c_5]) ).

cnf(c_9,plain,
    $false,
    inference(resolve,[status(thm)],[c_8,c_7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN066-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/5.59  % Computer : n004.cluster.edu
% 0.10/5.59  % Model    : x86_64 x86_64
% 0.10/5.59  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.59  % Memory   : 8046.5625MB
% 0.10/5.59  % OS       : Linux 6.8.0-71-generic
% 0.10/5.59  % CPULimit : 300
% 0.10/5.59  % WCLimit  : 300
% 0.10/5.59  % DateTime : Sat Sep 26 17:08:42 UTC 2026
% 0.10/5.59  % CPUTime  : 
% 0.10/5.60  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/5.60  % Process 2222028 was started by sandbox2 on n004,
% 0.10/5.60  % Sat Sep 26 17:08:42 2026
% 0.10/5.60  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.15/5.60  
% 0.15/5.60  % From the command line: assign(max_seconds, 300).
% 0.15/5.61  
% 0.15/5.61  % SZS status Unsatisfiable for theBenchmark
% 0.15/5.61  
% 0.15/5.61  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.15/5.61  % Length of proof is 9.
% 0.15/5.61  % Level of proof is 3.
% 0.15/5.61  % Maximum clause weight is 6.000.
% 0.15/5.61  % Given clauses 0.
% 0.15/5.61  
% 0.15/5.61  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------