↑ Up

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

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

% Computer : n011.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:06 AM UTC 2026

% Result   : Unsatisfiable 0.69s 0.58s
% Output   : CNFRefutation 0.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   27 (  17 unt;   0 def)
%            Number of atoms       :   47 (   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    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   30 (   7 sgn  11   !;   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_37,axiom,
    n0(b,a),
    file('theBenchmark.p',axiom_37) ).

cnf(c_2,plain,
    n0(b,a),
    inference(clausify,[status(thm)],[axiom_37]) ).

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]) ).

cnf(c_259,plain,
    k1(b),
    inference(resolve,[status(thm)],[c_1,c_6]) ).

cnf(c_263,plain,
    k1(a),
    inference(resolve,[status(thm)],[c_1,c_2]) ).

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

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

fof(rule_134,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ p0(VAR_1,VAR_0)
      | ~ m1(VAR_2,VAR_1,VAR_1)
      | ~ m0(VAR_1,VAR_0,VAR_2)
      | l2(VAR_0,VAR_0) ),
    file('theBenchmark.p',rule_134) ).

cnf(c_369,plain,
    ( ~ p0(B,A)
    | ~ m1(C,B,B)
    | ~ m0(B,A,C)
    | l2(A,A) ),
    inference(clausify,[status(thm)],[rule_134]) ).

fof(rule_034,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ q0(VAR_0,VAR_0)
      | ~ k1(VAR_1)
      | ~ k1(a)
      | m1(VAR_0,VAR_1,VAR_1) ),
    file('theBenchmark.p',rule_034) ).

cnf(c_445,plain,
    ( ~ q0(A,A)
    | ~ k1(B)
    | ~ k1(a)
    | m1(A,B,B) ),
    inference(clausify,[status(thm)],[rule_034]) ).

cnf(c_446,plain,
    ( ~ q0(A,A)
    | ~ k1(B)
    | m1(A,B,B) ),
    inference(resolve,[status(thm)],[c_263,c_445]) ).

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_14,axiom,
    ! [VAR_0] : p0(b,VAR_0),
    file('theBenchmark.p',axiom_14) ).

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

cnf(c_759,plain,
    ( ~ q0(A,A)
    | m1(A,b,b) ),
    inference(resolve,[status(thm)],[c_446,c_259]) ).

cnf(c_741,plain,
    m1(d,b,b),
    inference(resolve,[status(thm)],[c_759,c_487]) ).

cnf(c_760,plain,
    ( ~ p0(A,d)
    | ~ m1(B,A,A)
    | ~ m0(A,d,B) ),
    inference(resolve,[status(thm)],[c_369,c_264]) ).

cnf(c_761,plain,
    ( ~ p0(B,d)
    | ~ m1(A,B,B) ),
    inference(resolve,[status(thm)],[c_760,c_485]) ).

cnf(c_757,plain,
    ~ m1(A,b,b),
    inference(resolve,[status(thm)],[c_761,c_489]) ).

cnf(c_758,plain,
    $false,
    inference(resolve,[status(thm)],[c_757,c_741]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN123-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.38  % Computer : n011.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Sat Sep 26 17:13:30 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.38  % Process 1128662 was started by sandbox2 on n011,
% 0.11/0.38  % Sat Sep 26 17:13:30 2026
% 0.11/0.38  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.11/0.40  
% 0.11/0.40  % From the command line: assign(max_seconds, 300).
% 0.69/0.58  
% 0.69/0.58  % SZS status Unsatisfiable for theBenchmark
% 0.69/0.58  
% 0.69/0.58  % Proof 1 at 0.12 (+ 0.02) seconds.
% 0.69/0.58  % Length of proof is 15.
% 0.69/0.58  % Level of proof is 4.
% 0.69/0.58  % Maximum clause weight is 19.000.
% 0.69/0.58  % Given clauses 254.
% 0.69/0.58  
% 0.69/0.58  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------