↑ Up

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

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

% Result   : Unsatisfiable 1.23s 0.55s
% Output   : CNFRefutation 1.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   42 (  22 unt;   0 def)
%            Number of atoms       :   91 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :  101 (  52   ~;  49   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   12 (  11 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   67 (  19 sgn  19   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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]) ).

fof(axiom_7,axiom,
    n0(d,b),
    file('theBenchmark.p',axiom_7) ).

cnf(c_8,plain,
    n0(d,b),
    inference(clausify,[status(thm)],[axiom_7]) ).

fof(rule_092,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] :
      ( ~ p0(VAR_3,VAR_0)
      | ~ n0(VAR_2,VAR_1)
      | q1(VAR_0,VAR_1,VAR_0) ),
    file('theBenchmark.p',rule_092) ).

cnf(c_21,plain,
    ( ~ p0(D,A)
    | ~ n0(C,B)
    | q1(A,B,A) ),
    inference(clausify,[status(thm)],[rule_092]) ).

fof(rule_255,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ n0(VAR_2,VAR_0)
      | ~ q2(VAR_2,VAR_0,VAR_1)
      | q3(VAR_0,VAR_1) ),
    file('theBenchmark.p',rule_255) ).

cnf(c_27,plain,
    ( ~ n0(C,A)
    | ~ q2(C,A,B)
    | q3(A,B) ),
    inference(clausify,[status(thm)],[rule_255]) ).

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_187,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] :
      ( ~ q2(VAR_1,VAR_1,VAR_1)
      | ~ k0(VAR_1)
      | ~ m0(VAR_2,VAR_3,VAR_0)
      | ~ r1(VAR_1)
      | q2(VAR_0,VAR_1,VAR_0) ),
    file('theBenchmark.p',rule_187) ).

cnf(c_38,plain,
    ( ~ q2(B,B,B)
    | ~ k0(B)
    | ~ m0(C,D,A)
    | ~ r1(B)
    | q2(A,B,A) ),
    inference(clausify,[status(thm)],[rule_187]) ).

cnf(c_203,plain,
    ( ~ q2(d,b,A)
    | q3(b,A) ),
    inference(resolve,[status(thm)],[c_27,c_8]) ).

cnf(c_227,plain,
    ( ~ p0(B,A)
    | q1(A,b,A) ),
    inference(resolve,[status(thm)],[c_21,c_6]) ).

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

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

fof(rule_181,axiom,
    ! [VAR_0] :
      ( ~ p1(VAR_0,VAR_0,VAR_0)
      | q2(VAR_0,VAR_0,VAR_0) ),
    file('theBenchmark.p',rule_181) ).

cnf(c_330,plain,
    ( ~ p1(A,A,A)
    | q2(A,A,A) ),
    inference(clausify,[status(thm)],[rule_181]) ).

fof(rule_085,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ p0(VAR_1,VAR_0)
      | p1(VAR_0,VAR_0,VAR_0) ),
    file('theBenchmark.p',rule_085) ).

cnf(c_406,plain,
    ( ~ p0(B,A)
    | p1(A,A,A) ),
    inference(clausify,[status(thm)],[rule_085]) ).

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

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

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

fof(axiom_6,axiom,
    q0(b,b),
    file('theBenchmark.p',axiom_6) ).

cnf(c_493,plain,
    q0(b,b),
    inference(clausify,[status(thm)],[axiom_6]) ).

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_506,plain,
    ( ~ q2(A,A,A)
    | ~ k0(A)
    | ~ m0(D,E,C)
    | q2(C,A,C)
    | ~ q1(d,B,d)
    | ~ s0(d)
    | ~ q0(A,B) ),
    inference(resolve,[status(thm)],[c_31,c_38]) ).

cnf(c_507,plain,
    ( ~ q2(A,A,A)
    | ~ k0(A)
    | ~ m0(D,E,C)
    | q2(C,A,C)
    | ~ q1(d,B,d)
    | ~ q0(A,B) ),
    inference(resolve,[status(thm)],[c_495,c_506]) ).

cnf(c_673,plain,
    ~ q2(d,b,d),
    inference(resolve,[status(thm)],[c_264,c_203]) ).

cnf(c_834,plain,
    p1(A,A,A),
    inference(resolve,[status(thm)],[c_489,c_406]) ).

cnf(c_844,plain,
    q1(A,b,A),
    inference(resolve,[status(thm)],[c_489,c_227]) ).

cnf(c_851,plain,
    q2(A,A,A),
    inference(resolve,[status(thm)],[c_834,c_330]) ).

cnf(c_873,plain,
    ( ~ k0(A)
    | ~ m0(D,E,C)
    | q2(C,A,C)
    | ~ q1(d,B,d)
    | ~ q0(A,B) ),
    inference(resolve,[status(thm)],[c_851,c_507]) ).

cnf(c_1396,plain,
    ( ~ k0(b)
    | ~ m0(B,C,A)
    | q2(A,b,A)
    | ~ q1(d,b,d) ),
    inference(resolve,[status(thm)],[c_873,c_493]) ).

cnf(c_1397,plain,
    ( ~ k0(b)
    | ~ m0(B,C,A)
    | q2(A,b,A) ),
    inference(resolve,[status(thm)],[c_1396,c_844]) ).

cnf(c_1398,plain,
    ( ~ k0(b)
    | q2(A,b,A) ),
    inference(resolve,[status(thm)],[c_1397,c_485]) ).

cnf(c_1394,plain,
    q2(A,b,A),
    inference(resolve,[status(thm)],[c_1398,c_474]) ).

cnf(c_1395,plain,
    $false,
    inference(resolve,[status(thm)],[c_1394,c_673]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN178-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.09/0.35  % Computer : n014.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sat Sep 26 17:18:32 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.35  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.35  % Process 3710609 was started by sandbox2 on n014,
% 0.09/0.35  % Sat Sep 26 17:18:32 2026
% 0.09/0.35  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.36  
% 0.09/0.36  % From the command line: assign(max_seconds, 300).
% 1.23/0.55  
% 1.23/0.55  % given #500 (A,wt=11): 826 m1(A,B,A) | -r0(A).  [resolve(489,a,466,b)].
% 1.23/0.55  
% 1.23/0.55  % SZS status Unsatisfiable for theBenchmark
% 1.23/0.55  
% 1.23/0.55  % Proof 1 at 0.15 (+ 0.02) seconds.
% 1.23/0.55  % Length of proof is 25.
% 1.23/0.55  % Level of proof is 5.
% 1.23/0.55  % Maximum clause weight is 26.000.
% 1.23/0.55  % Given clauses 552.
% 1.23/0.55  
% 1.23/0.55  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------