↑ Up

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

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

% Result   : Unsatisfiable 0.96s 0.62s
% Output   : CNFRefutation 0.96s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   23 (  13 unt;   0 def)
%            Number of atoms       :   45 (   0 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   50 (  28   ~;  22   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   24 (   5 sgn   9   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(rule_124,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ q1(d,VAR_1,d)
      | ~ s0(d)
      | ~ q0(VAR_0,VAR_1)
      | r1(VAR_0) ),
    file('theBenchmark.p',rule_124) ).

cnf(c_31,plain,
    ( ~ q1(d,B,d)
    | ~ s0(d)
    | ~ q0(A,B)
    | r1(A) ),
    inference(clausify,[status(thm)],[rule_124]) ).

fof(rule_188,axiom,
    ! [VAR_0] :
      ( ~ l0(VAR_0)
      | ~ r1(VAR_0)
      | r2(VAR_0) ),
    file('theBenchmark.p',rule_188) ).

cnf(c_39,plain,
    ( ~ l0(A)
    | ~ r1(A)
    | r2(A) ),
    inference(clausify,[status(thm)],[rule_188]) ).

cnf(c_59,plain,
    ( ~ l0(A)
    | r2(A)
    | ~ q1(d,B,d)
    | ~ s0(d)
    | ~ q0(A,B) ),
    inference(resolve,[status(thm)],[c_31,c_39]) ).

fof(prove_this,axiom,
    ~ r2(c),
    file('theBenchmark.p',prove_this) ).

cnf(c_76,plain,
    ~ r2(c),
    inference(clausify,[status(thm)],[prove_this]) ).

fof(rule_121,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ m0(VAR_1,VAR_2,VAR_0)
      | q1(VAR_0,VAR_0,VAR_0) ),
    file('theBenchmark.p',rule_121) ).

cnf(c_380,plain,
    ( ~ m0(B,C,A)
    | q1(A,A,A) ),
    inference(clausify,[status(thm)],[rule_121]) ).

fof(axiom_24,axiom,
    l0(c),
    file('theBenchmark.p',axiom_24) ).

cnf(c_480,plain,
    l0(c),
    inference(clausify,[status(thm)],[axiom_24]) ).

fof(axiom_19,axiom,
    ! [VAR_0,VAR_1] : m0(VAR_0,d,VAR_1),
    file('theBenchmark.p',axiom_19) ).

cnf(c_485,plain,
    m0(A,d,B),
    inference(clausify,[status(thm)],[axiom_19]) ).

fof(axiom_17,axiom,
    ! [VAR_0] : q0(VAR_0,d),
    file('theBenchmark.p',axiom_17) ).

cnf(c_487,plain,
    q0(A,d),
    inference(clausify,[status(thm)],[axiom_17]) ).

fof(axiom_1,axiom,
    s0(d),
    file('theBenchmark.p',axiom_1) ).

cnf(c_495,plain,
    s0(d),
    inference(clausify,[status(thm)],[axiom_1]) ).

cnf(c_542,plain,
    ( ~ l0(c)
    | ~ q1(d,A,d)
    | ~ s0(d)
    | ~ q0(c,A) ),
    inference(resolve,[status(thm)],[c_59,c_76]) ).

cnf(c_881,plain,
    ( ~ l0(c)
    | ~ q1(d,A,d)
    | ~ q0(c,A) ),
    inference(resolve,[status(thm)],[c_495,c_542]) ).

cnf(c_543,plain,
    ( ~ q1(d,A,d)
    | ~ q0(c,A) ),
    inference(resolve,[status(thm)],[c_480,c_881]) ).

cnf(c_789,plain,
    q1(A,A,A),
    inference(resolve,[status(thm)],[c_485,c_380]) ).

cnf(c_882,plain,
    ~ q1(d,d,d),
    inference(resolve,[status(thm)],[c_543,c_487]) ).

cnf(c_880,plain,
    $false,
    inference(resolve,[status(thm)],[c_789,c_882]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SYN189-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.41  % Computer : n018.cluster.edu
% 0.16/0.41  % Model    : x86_64 x86_64
% 0.16/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.41  % Memory   : 8046.5625MB
% 0.16/0.41  % OS       : Linux 6.8.0-71-generic
% 0.16/0.42  % CPULimit : 300
% 0.16/0.42  % WCLimit  : 300
% 0.16/0.42  % DateTime : Sat Sep 26 17:21:36 UTC 2026
% 0.16/0.42  % CPUTime  : 
% 0.16/0.42  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.16/0.42  % Process 978482 was started by sandbox on n018,
% 0.16/0.42  % Sat Sep 26 17:21:36 2026
% 0.16/0.42  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.16/0.44  
% 0.16/0.44  % From the command line: assign(max_seconds, 300).
% 0.96/0.62  
% 0.96/0.62  % SZS status Unsatisfiable for theBenchmark
% 0.96/0.62  
% 0.96/0.62  % Proof 1 at 0.15 (+ 0.02) seconds.
% 0.96/0.62  % Length of proof is 13.
% 0.96/0.62  % Level of proof is 4.
% 0.96/0.62  % Maximum clause weight is 13.000.
% 0.96/0.62  % Given clauses 274.
% 0.96/0.62  
% 0.96/0.62  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------