↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : SYN009-2 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n010.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:14 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(clause_8,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( r(VAR_2,VAR_0,VAR_1)
      | q(VAR_1,VAR_2,VAR_0)
      | p(VAR_0,VAR_1,VAR_2)
      | ~ s(VAR_2)
      | ~ s(VAR_1)
      | ~ s(VAR_0) ),
    file('theBenchmark.p',clause_8) ).

cnf(c_1,plain,
    ( r(C,A,B)
    | q(B,C,A)
    | p(A,B,C)
    | ~ s(C)
    | ~ s(B)
    | ~ s(A) ),
    inference(clausify,[status(thm)],[clause_8]) ).

fof(clause_1,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ t(VAR_0,VAR_1,VAR_2)
      | ~ p(VAR_0,VAR_1,VAR_2) ),
    file('theBenchmark.p',clause_1) ).

cnf(c_2,plain,
    ( ~ t(A,B,C)
    | ~ p(A,B,C) ),
    inference(clausify,[status(thm)],[clause_1]) ).

fof(clause_7,axiom,
    t(c,c,c),
    file('theBenchmark.p',clause_7) ).

cnf(c_3,plain,
    t(c,c,c),
    inference(clausify,[status(thm)],[clause_7]) ).

cnf(c_4,plain,
    ( ~ t(A,B,C)
    | r(C,A,B)
    | q(B,C,A)
    | ~ s(C)
    | ~ s(B)
    | ~ s(A) ),
    inference(resolve,[status(thm)],[c_1,c_2]) ).

fof(clause_3,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ t(VAR_2,VAR_0,VAR_1)
      | ~ r(VAR_0,VAR_1,VAR_2) ),
    file('theBenchmark.p',clause_3) ).

cnf(c_5,plain,
    ( ~ t(C,A,B)
    | ~ r(A,B,C) ),
    inference(clausify,[status(thm)],[clause_3]) ).

fof(clause_2,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ t(VAR_1,VAR_2,VAR_0)
      | ~ q(VAR_0,VAR_1,VAR_2) ),
    file('theBenchmark.p',clause_2) ).

cnf(c_6,plain,
    ( ~ t(B,C,A)
    | ~ q(A,B,C) ),
    inference(clausify,[status(thm)],[clause_2]) ).

cnf(c_7,plain,
    ( r(c,c,c)
    | q(c,c,c)
    | ~ s(c)
    | ~ s(c)
    | ~ s(c) ),
    inference(resolve,[status(thm)],[c_3,c_4]) ).

cnf(c_8,plain,
    ~ q(c,c,c),
    inference(resolve,[status(thm)],[c_6,c_3]) ).

cnf(c_9,plain,
    ~ r(c,c,c),
    inference(resolve,[status(thm)],[c_5,c_3]) ).

cnf(c_10,plain,
    ( r(c,c,c)
    | ~ s(c)
    | ~ s(c)
    | ~ s(c) ),
    inference(resolve,[status(thm)],[c_7,c_8]) ).

cnf(c_11,plain,
    ( ~ s(c)
    | ~ s(c)
    | ~ s(c) ),
    inference(resolve,[status(thm)],[c_9,c_10]) ).

cnf(c_17,plain,
    ( ~ s(c)
    | ~ s(c) ),
    inference(copy,[status(thm)],[c_11]) ).

cnf(c_12,plain,
    ~ s(c),
    inference(copy,[status(thm)],[c_17]) ).

fof(clause_6,axiom,
    s(c),
    file('theBenchmark.p',clause_6) ).

cnf(c_15,plain,
    s(c),
    inference(clausify,[status(thm)],[clause_6]) ).

cnf(c_16,plain,
    $false,
    inference(resolve,[status(thm)],[c_12,c_15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN009-2 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.34  % Computer : n010.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 17:04:03 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 0.07/0.35  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.07/0.35  % Process 3768664 was started by sandbox on n010,
% 0.07/0.35  % Sat Sep 26 17:04:03 2026
% 0.07/0.35  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.07/0.35  
% 0.07/0.35  % From the command line: assign(max_seconds, 300).
% 0.07/0.35  
% 0.07/0.35  % SZS status Unsatisfiable for theBenchmark
% 0.07/0.35  
% 0.07/0.35  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.07/0.35  % Length of proof is 14.
% 0.07/0.35  % Level of proof is 6.
% 0.07/0.35  % Maximum clause weight is 2.000.
% 0.07/0.35  % Given clauses 0.
% 0.07/0.35  
% 0.07/0.35  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------