↑ Up

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

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

% Result   : Unsatisfiable 0.80s 0.51s
% Output   : CNFRefutation 0.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   26 (  16 unt;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   45 (  25   ~;  20   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   25 (   5 sgn  10   !;   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_34,axiom,
    n0(c,d),
    file('theBenchmark.p',axiom_34) ).

cnf(c_3,plain,
    n0(c,d),
    inference(clausify,[status(thm)],[axiom_34]) ).

cnf(c_262,plain,
    k1(d),
    inference(resolve,[status(thm)],[c_1,c_3]) ).

fof(prove_this,axiom,
    ~ q1(a,d,d),
    file('theBenchmark.p',prove_this) ).

cnf(c_264,plain,
    ~ q1(a,d,d),
    inference(clausify,[status(thm)],[prove_this]) ).

fof(rule_109,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ k1(VAR_0)
      | ~ q0(VAR_1,VAR_0)
      | ~ p0(VAR_2,VAR_2)
      | q1(VAR_0,VAR_0,VAR_1) ),
    file('theBenchmark.p',rule_109) ).

cnf(c_382,plain,
    ( ~ k1(A)
    | ~ q0(B,A)
    | ~ p0(C,C)
    | q1(A,A,B) ),
    inference(clausify,[status(thm)],[rule_109]) ).

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

cnf(c_391,plain,
    ( ~ q1(B,B,C)
    | ~ l0(A)
    | ~ k0(C)
    | q1(A,B,B) ),
    inference(clausify,[status(thm)],[rule_099]) ).

fof(axiom_32,axiom,
    k0(b),
    file('theBenchmark.p',axiom_32) ).

cnf(c_466,plain,
    k0(b),
    inference(clausify,[status(thm)],[axiom_32]) ).

fof(axiom_20,axiom,
    l0(a),
    file('theBenchmark.p',axiom_20) ).

cnf(c_476,plain,
    l0(a),
    inference(clausify,[status(thm)],[axiom_20]) ).

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

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

fof(axiom_14,axiom,
    ! [VAR_0] : p0(b,VAR_0),
    file('theBenchmark.p',axiom_14) ).

cnf(c_481,plain,
    p0(b,A),
    inference(clausify,[status(thm)],[axiom_14]) ).

cnf(c_621,plain,
    ( ~ q1(d,d,A)
    | ~ l0(a)
    | ~ k0(A) ),
    inference(resolve,[status(thm)],[c_391,c_264]) ).

cnf(c_622,plain,
    ( ~ q1(d,d,b)
    | ~ l0(a) ),
    inference(resolve,[status(thm)],[c_621,c_466]) ).

cnf(c_594,plain,
    ~ q1(d,d,b),
    inference(resolve,[status(thm)],[c_622,c_476]) ).

cnf(c_623,plain,
    ( ~ k1(A)
    | ~ q0(B,A)
    | q1(A,A,B) ),
    inference(resolve,[status(thm)],[c_382,c_481]) ).

cnf(c_624,plain,
    ( ~ k1(d)
    | q1(d,d,A) ),
    inference(resolve,[status(thm)],[c_623,c_479]) ).

cnf(c_619,plain,
    q1(d,d,A),
    inference(resolve,[status(thm)],[c_624,c_262]) ).

cnf(c_620,plain,
    $false,
    inference(resolve,[status(thm)],[c_619,c_594]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN285-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.10/0.37  % Computer : n018.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sat Sep 26 17:32:08 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.37  % Process 992172 was started by sandbox on n018,
% 0.10/0.37  % Sat Sep 26 17:32:08 2026
% 0.10/0.37  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.38  
% 0.10/0.38  % From the command line: assign(max_seconds, 300).
% 0.80/0.51  
% 0.80/0.51  % SZS status Unsatisfiable for theBenchmark
% 0.80/0.51  
% 0.80/0.51  % Proof 1 at 0.10 (+ 0.01) seconds.
% 0.80/0.51  % Length of proof is 13.
% 0.80/0.51  % Level of proof is 3.
% 0.80/0.51  % Maximum clause weight is 14.000.
% 0.80/0.51  % Given clauses 335.
% 0.80/0.51  
% 0.80/0.51  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------