↑ Up

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

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

% Result   : Unsatisfiable 0.76s 0.50s
% Output   : CNFRefutation 0.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   43 (  16 unt;   0 def)
%            Number of atoms       :   82 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   85 (  46   ~;  39   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   13 (  12 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   75 (  31 sgn  24   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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(rule_002,axiom,
    ! [VAR_0,VAR_1] :
      ( ~ n0(VAR_1,VAR_0)
      | l1(VAR_0,VAR_0) ),
    file('theBenchmark.p',rule_002) ).

cnf(c_10,plain,
    ( ~ n0(B,A)
    | l1(A,A) ),
    inference(clausify,[status(thm)],[rule_002]) ).

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

cnf(c_17,plain,
    ( ~ n0(B,A)
    | p1(A,A,A) ),
    inference(clausify,[status(thm)],[rule_066]) ).

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_137,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ p1(VAR_1,VAR_2,VAR_0)
      | n2(VAR_0) ),
    file('theBenchmark.p',rule_137) ).

cnf(c_46,plain,
    ( ~ p1(B,C,A)
    | n2(A) ),
    inference(clausify,[status(thm)],[rule_137]) ).

fof(rule_244,axiom,
    ! [VAR_0] :
      ( ~ n2(VAR_0)
      | p3(VAR_0,VAR_0,VAR_0) ),
    file('theBenchmark.p',rule_244) ).

cnf(c_56,plain,
    ( ~ n2(A)
    | p3(A,A,A) ),
    inference(clausify,[status(thm)],[rule_244]) ).

fof(rule_299,axiom,
    ! [VAR_0,VAR_1,VAR_2,VAR_3] :
      ( ~ l1(VAR_0,VAR_2)
      | ~ p3(VAR_1,VAR_2,VAR_3)
      | s4(VAR_0) ),
    file('theBenchmark.p',rule_299) ).

cnf(c_117,plain,
    ( ~ l1(A,C)
    | ~ p3(B,C,D)
    | s4(A) ),
    inference(clausify,[status(thm)],[rule_299]) ).

fof(rule_300,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ r3(VAR_2,VAR_0,VAR_0)
      | ~ s4(VAR_1)
      | k5(VAR_0) ),
    file('theBenchmark.p',rule_300) ).

cnf(c_118,plain,
    ( ~ r3(C,A,A)
    | ~ s4(B)
    | k5(A) ),
    inference(clausify,[status(thm)],[rule_300]) ).

cnf(c_126,plain,
    ( ~ r3(F,E,E)
    | k5(E)
    | ~ l1(D,B)
    | ~ p3(A,B,C) ),
    inference(resolve,[status(thm)],[c_117,c_118]) ).

fof(prove_this,axiom,
    ~ k5(e),
    file('theBenchmark.p',prove_this) ).

cnf(c_129,plain,
    ~ k5(e),
    inference(clausify,[status(thm)],[prove_this]) ).

cnf(c_133,plain,
    ( ~ r3(E,e,e)
    | ~ l1(D,B)
    | ~ p3(A,B,C) ),
    inference(resolve,[status(thm)],[c_129,c_126]) ).

cnf(c_172,plain,
    ( ~ p1(B,C,A)
    | p3(A,A,A) ),
    inference(resolve,[status(thm)],[c_56,c_46]) ).

cnf(c_233,plain,
    ( ~ p0(B,A)
    | q1(A,a,A) ),
    inference(resolve,[status(thm)],[c_21,c_2]) ).

cnf(c_240,plain,
    p1(a,a,a),
    inference(resolve,[status(thm)],[c_17,c_2]) ).

cnf(c_260,plain,
    l1(a,a),
    inference(resolve,[status(thm)],[c_10,c_2]) ).

fof(rule_267,axiom,
    ! [VAR_0,VAR_1,VAR_2] :
      ( ~ p2(VAR_0,VAR_2,VAR_1)
      | r3(VAR_0,VAR_1,VAR_0) ),
    file('theBenchmark.p',rule_267) ).

cnf(c_295,plain,
    ( ~ p2(A,C,B)
    | r3(A,B,A) ),
    inference(clausify,[status(thm)],[rule_267]) ).

fof(rule_141,axiom,
    ! [VAR_0] :
      ( ~ q1(VAR_0,a,VAR_0)
      | p2(VAR_0,a,VAR_0) ),
    file('theBenchmark.p',rule_141) ).

cnf(c_366,plain,
    ( ~ q1(A,a,A)
    | p2(A,a,A) ),
    inference(clausify,[status(thm)],[rule_141]) ).

fof(rule_087,axiom,
    ( ~ p1(a,a,a)
    | ~ r0(b)
    | p1(a,b,a) ),
    file('theBenchmark.p',rule_087) ).

cnf(c_404,plain,
    ( ~ p1(a,a,a)
    | ~ r0(b)
    | p1(a,b,a) ),
    inference(clausify,[status(thm)],[rule_087]) ).

cnf(c_405,plain,
    ( ~ r0(b)
    | p1(a,b,a) ),
    inference(resolve,[status(thm)],[c_240,c_404]) ).

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

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

fof(axiom_9,axiom,
    r0(b),
    file('theBenchmark.p',axiom_9) ).

cnf(c_493,plain,
    r0(b),
    inference(clausify,[status(thm)],[axiom_9]) ).

cnf(c_604,plain,
    p1(a,b,a),
    inference(resolve,[status(thm)],[c_493,c_405]) ).

cnf(c_628,plain,
    ( ~ r3(E,e,e)
    | ~ l1(D,C)
    | ~ p1(A,B,C) ),
    inference(resolve,[status(thm)],[c_172,c_133]) ).

cnf(c_831,plain,
    q1(A,a,A),
    inference(resolve,[status(thm)],[c_490,c_233]) ).

cnf(c_859,plain,
    p2(A,a,A),
    inference(resolve,[status(thm)],[c_831,c_366]) ).

cnf(c_924,plain,
    ( ~ r3(B,e,e)
    | ~ l1(A,a) ),
    inference(resolve,[status(thm)],[c_628,c_604]) ).

cnf(c_916,plain,
    ~ r3(A,e,e),
    inference(resolve,[status(thm)],[c_924,c_260]) ).

cnf(c_922,plain,
    ~ p2(e,A,e),
    inference(resolve,[status(thm)],[c_916,c_295]) ).

cnf(c_923,plain,
    $false,
    inference(resolve,[status(thm)],[c_922,c_859]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN117-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.11/0.35  % Computer : n019.cluster.edu
% 0.11/0.35  % Model    : x86_64 x86_64
% 0.11/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35  % Memory   : 8046.5625MB
% 0.11/0.35  % OS       : Linux 6.8.0-71-generic
% 0.11/0.35  % CPULimit : 300
% 0.11/0.35  % WCLimit  : 300
% 0.11/0.35  % DateTime : Sat Sep 26 17:12:48 UTC 2026
% 0.11/0.35  % CPUTime  : 
% 0.11/0.36  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.36  % Process 1825832 was started by sandbox on n019,
% 0.11/0.36  % Sat Sep 26 17:12:48 2026
% 0.11/0.36  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.13/0.37  
% 0.13/0.37  % From the command line: assign(max_seconds, 300).
% 0.76/0.50  
% 0.76/0.50  % SZS status Unsatisfiable for theBenchmark
% 0.76/0.50  
% 0.76/0.50  % Proof 1 at 0.12 (+ 0.01) seconds.
% 0.76/0.50  % Length of proof is 28.
% 0.76/0.50  % Level of proof is 6.
% 0.76/0.50  % Maximum clause weight is 16.000.
% 0.76/0.50  % Given clauses 318.
% 0.76/0.50  
% 0.76/0.50  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------