↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : LCL366-1 : TPTP v9.3.1. Bugfixed v5.5.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 07:58:40 AM UTC 2026

% Result   : Unsatisfiable 10.69s 1.88s
% Output   : CNFRefutation 10.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   33
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   77 (  42 unt;   0 def)
%            Number of atoms       :  114 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   76 (  39   ~;  37   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :  209 (  47 sgn   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(condensed_detachment,axiom,
    ! [VAR_0,VAR_1] :
      ( is_a_theorem(VAR_1)
      | ~ is_a_theorem(VAR_0)
      | ~ is_a_theorem(implies(VAR_0,VAR_1)) ),
    file('theBenchmark.p',condensed_detachment) ).

cnf(c_1,plain,
    ( is_a_theorem(B)
    | ~ is_a_theorem(A)
    | ~ is_a_theorem(implies(A,B)) ),
    inference(clausify,[status(thm)],[condensed_detachment]) ).

fof(cn_1,axiom,
    ! [VAR_0,VAR_1,VAR_2] : is_a_theorem(implies(implies(VAR_0,VAR_1),implies(implies(VAR_1,VAR_2),implies(VAR_0,VAR_2)))),
    file('theBenchmark.p',cn_1) ).

cnf(c_2,plain,
    is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))),
    inference(clausify,[status(thm)],[cn_1]) ).

fof(cn_2,axiom,
    ! [VAR_0] : is_a_theorem(implies(implies(not(VAR_0),VAR_0),VAR_0)),
    file('theBenchmark.p',cn_2) ).

cnf(c_3,plain,
    is_a_theorem(implies(implies(not(A),A),A)),
    inference(clausify,[status(thm)],[cn_2]) ).

fof(cn_3,axiom,
    ! [VAR_0,VAR_1] : is_a_theorem(implies(VAR_0,implies(not(VAR_0),VAR_1))),
    file('theBenchmark.p',cn_3) ).

cnf(c_4,plain,
    is_a_theorem(implies(A,implies(not(A),B))),
    inference(clausify,[status(thm)],[cn_3]) ).

fof(prove_cn_15,axiom,
    ~ is_a_theorem(implies(implies(not(x),y),implies(implies(y,x),x))),
    file('theBenchmark.p',prove_cn_15) ).

cnf(c_5,plain,
    ~ is_a_theorem(implies(implies(not(x),y),implies(implies(y,x),x))),
    inference(clausify,[status(thm)],[prove_cn_15]) ).

cnf(c_5370,plain,
    ( is_a_theorem(implies(implies(B,C),implies(A,C)))
    | ~ is_a_theorem(implies(A,B)) ),
    inference(resolve,[status(thm)],[c_1,c_2]) ).

cnf(c_6,plain,
    is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))),
    inference(resolve,[status(thm)],[c_5370,c_2]) ).

cnf(c_5371,plain,
    ( is_a_theorem(implies(implies(B,C),implies(A,C)))
    | ~ is_a_theorem(implies(A,B)) ),
    inference(resolve,[status(thm)],[c_1,c_2]) ).

cnf(c_7,plain,
    is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))),
    inference(resolve,[status(thm)],[c_5371,c_3]) ).

cnf(c_5372,plain,
    ( is_a_theorem(implies(implies(B,C),implies(A,C)))
    | ~ is_a_theorem(implies(A,B)) ),
    inference(resolve,[status(thm)],[c_1,c_2]) ).

cnf(c_9,plain,
    is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))),
    inference(resolve,[status(thm)],[c_5372,c_4]) ).

cnf(c_5373,plain,
    ( is_a_theorem(implies(implies(C,A),D))
    | ~ is_a_theorem(implies(implies(implies(A,B),implies(C,B)),D)) ),
    inference(resolve,[status(thm)],[c_1,c_6]) ).

cnf(c_12,plain,
    is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))),
    inference(resolve,[status(thm)],[c_5373,c_6]) ).

cnf(c_5374,plain,
    ( is_a_theorem(implies(implies(not(A),A),B))
    | ~ is_a_theorem(implies(A,B)) ),
    inference(resolve,[status(thm)],[c_1,c_7]) ).

cnf(c_17,plain,
    is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(not(A),A),B))),
    inference(resolve,[status(thm)],[c_5374,c_7]) ).

cnf(c_5375,plain,
    ( is_a_theorem(implies(implies(not(A),A),B))
    | ~ is_a_theorem(implies(A,B)) ),
    inference(resolve,[status(thm)],[c_1,c_7]) ).

cnf(c_21,plain,
    is_a_theorem(implies(implies(not(implies(implies(implies(A,B),implies(C,B)),D)),implies(implies(implies(A,B),implies(C,B)),D)),implies(implies(C,A),D))),
    inference(resolve,[status(thm)],[c_5375,c_6]) ).

cnf(c_5376,plain,
    ( is_a_theorem(implies(implies(C,A),D))
    | ~ is_a_theorem(implies(implies(implies(A,B),implies(C,B)),D)) ),
    inference(resolve,[status(thm)],[c_1,c_6]) ).

cnf(c_32,plain,
    is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))),
    inference(resolve,[status(thm)],[c_5376,c_9]) ).

cnf(c_5377,plain,
    ( is_a_theorem(implies(A,C))
    | ~ is_a_theorem(implies(implies(not(A),B),C)) ),
    inference(resolve,[status(thm)],[c_1,c_9]) ).

cnf(c_37,plain,
    is_a_theorem(implies(A,A)),
    inference(resolve,[status(thm)],[c_5377,c_3]) ).

cnf(c_5378,plain,
    ( is_a_theorem(implies(not(A),B))
    | ~ is_a_theorem(A) ),
    inference(resolve,[status(thm)],[c_1,c_4]) ).

cnf(c_39,plain,
    is_a_theorem(implies(not(implies(A,A)),B)),
    inference(resolve,[status(thm)],[c_5378,c_37]) ).

cnf(c_5379,plain,
    ( is_a_theorem(implies(B,implies(A,C)))
    | ~ is_a_theorem(implies(A,not(B))) ),
    inference(resolve,[status(thm)],[c_1,c_32]) ).

cnf(c_50,plain,
    is_a_theorem(implies(A,implies(not(implies(B,B)),C))),
    inference(resolve,[status(thm)],[c_5379,c_39]) ).

cnf(c_5380,plain,
    ( is_a_theorem(implies(implies(B,C),implies(A,C)))
    | ~ is_a_theorem(implies(A,B)) ),
    inference(resolve,[status(thm)],[c_1,c_2]) ).

cnf(c_54,plain,
    is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))),
    inference(resolve,[status(thm)],[c_5380,c_50]) ).

cnf(c_5381,plain,
    ( is_a_theorem(implies(D,C))
    | ~ is_a_theorem(implies(implies(not(implies(A,A)),B),C)) ),
    inference(resolve,[status(thm)],[c_1,c_54]) ).

cnf(c_205,plain,
    is_a_theorem(implies(A,implies(implies(not(B),B),B))),
    inference(resolve,[status(thm)],[c_5381,c_17]) ).

cnf(c_5382,plain,
    ( is_a_theorem(implies(D,C))
    | ~ is_a_theorem(implies(implies(not(implies(A,A)),B),C)) ),
    inference(resolve,[status(thm)],[c_1,c_54]) ).

cnf(c_206,plain,
    is_a_theorem(implies(A,implies(B,B))),
    inference(resolve,[status(thm)],[c_5382,c_3]) ).

cnf(c_5383,plain,
    ( is_a_theorem(implies(implies(B,C),implies(A,C)))
    | ~ is_a_theorem(implies(A,B)) ),
    inference(resolve,[status(thm)],[c_1,c_2]) ).

cnf(c_212,plain,
    is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))),
    inference(resolve,[status(thm)],[c_5383,c_206]) ).

cnf(c_5384,plain,
    ( is_a_theorem(implies(implies(D,B),implies(A,implies(D,C))))
    | ~ is_a_theorem(implies(A,implies(B,C))) ),
    inference(resolve,[status(thm)],[c_1,c_12]) ).

cnf(c_263,plain,
    is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))),
    inference(resolve,[status(thm)],[c_5384,c_205]) ).

cnf(c_5385,plain,
    ( is_a_theorem(implies(implies(C,A),D))
    | ~ is_a_theorem(implies(implies(implies(A,B),implies(C,B)),D)) ),
    inference(resolve,[status(thm)],[c_1,c_6]) ).

cnf(c_409,plain,
    is_a_theorem(implies(implies(not(A),B),implies(C,implies(implies(B,A),A)))),
    inference(resolve,[status(thm)],[c_5385,c_263]) ).

cnf(c_5386,plain,
    ( is_a_theorem(implies(C,implies(A,B)))
    | ~ is_a_theorem(implies(A,implies(not(B),B))) ),
    inference(resolve,[status(thm)],[c_1,c_263]) ).

cnf(c_413,plain,
    is_a_theorem(implies(A,implies(implies(implies(B,B),C),C))),
    inference(resolve,[status(thm)],[c_5386,c_212]) ).

cnf(c_5387,plain,
    ( is_a_theorem(implies(implies(implies(B,B),C),C))
    | ~ is_a_theorem(A) ),
    inference(resolve,[status(thm)],[c_1,c_413]) ).

cnf(c_419,plain,
    is_a_theorem(implies(implies(implies(A,A),B),B)),
    inference(resolve,[status(thm)],[c_5387,c_413]) ).

cnf(c_5388,plain,
    ( is_a_theorem(implies(B,implies(A,C)))
    | ~ is_a_theorem(implies(A,not(B))) ),
    inference(resolve,[status(thm)],[c_1,c_32]) ).

cnf(c_436,plain,
    is_a_theorem(implies(A,implies(implies(implies(B,B),not(A)),C))),
    inference(resolve,[status(thm)],[c_5388,c_419]) ).

cnf(c_5389,plain,
    ( is_a_theorem(implies(A,C))
    | ~ is_a_theorem(implies(implies(not(A),B),C)) ),
    inference(resolve,[status(thm)],[c_1,c_9]) ).

cnf(c_721,plain,
    is_a_theorem(implies(A,implies(B,implies(implies(C,A),A)))),
    inference(resolve,[status(thm)],[c_5389,c_409]) ).

cnf(c_5390,plain,
    ( is_a_theorem(implies(C,implies(A,B)))
    | ~ is_a_theorem(implies(A,implies(not(B),B))) ),
    inference(resolve,[status(thm)],[c_1,c_263]) ).

cnf(c_744,plain,
    is_a_theorem(implies(A,implies(B,implies(implies(C,B),B)))),
    inference(resolve,[status(thm)],[c_5390,c_721]) ).

cnf(c_5391,plain,
    ( is_a_theorem(implies(B,implies(implies(C,B),B)))
    | ~ is_a_theorem(A) ),
    inference(resolve,[status(thm)],[c_1,c_744]) ).

cnf(c_797,plain,
    is_a_theorem(implies(A,implies(implies(B,A),A))),
    inference(resolve,[status(thm)],[c_5391,c_744]) ).

cnf(c_5392,plain,
    ( is_a_theorem(implies(implies(D,B),implies(A,implies(D,C))))
    | ~ is_a_theorem(implies(A,implies(B,C))) ),
    inference(resolve,[status(thm)],[c_1,c_12]) ).

cnf(c_821,plain,
    is_a_theorem(implies(implies(A,implies(B,C)),implies(C,implies(A,C)))),
    inference(resolve,[status(thm)],[c_5392,c_797]) ).

cnf(c_5393,plain,
    ( is_a_theorem(implies(C,implies(A,C)))
    | ~ is_a_theorem(implies(A,implies(B,C))) ),
    inference(resolve,[status(thm)],[c_1,c_821]) ).

cnf(c_860,plain,
    is_a_theorem(implies(A,implies(B,A))),
    inference(resolve,[status(thm)],[c_5393,c_436]) ).

cnf(c_5394,plain,
    ( is_a_theorem(implies(implies(B,C),implies(A,C)))
    | ~ is_a_theorem(implies(A,B)) ),
    inference(resolve,[status(thm)],[c_1,c_2]) ).

cnf(c_872,plain,
    is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))),
    inference(resolve,[status(thm)],[c_5394,c_860]) ).

cnf(c_5395,plain,
    ( is_a_theorem(implies(B,C))
    | ~ is_a_theorem(implies(implies(A,B),C)) ),
    inference(resolve,[status(thm)],[c_1,c_872]) ).

cnf(c_921,plain,
    is_a_theorem(implies(A,implies(B,implies(implies(A,C),C)))),
    inference(resolve,[status(thm)],[c_5395,c_409]) ).

cnf(c_5396,plain,
    ( is_a_theorem(implies(C,implies(A,B)))
    | ~ is_a_theorem(implies(A,implies(not(B),B))) ),
    inference(resolve,[status(thm)],[c_1,c_263]) ).

cnf(c_1260,plain,
    is_a_theorem(implies(A,implies(B,implies(implies(B,C),C)))),
    inference(resolve,[status(thm)],[c_5396,c_921]) ).

cnf(c_5397,plain,
    ( is_a_theorem(implies(B,implies(implies(B,C),C)))
    | ~ is_a_theorem(A) ),
    inference(resolve,[status(thm)],[c_1,c_1260]) ).

cnf(c_1505,plain,
    is_a_theorem(implies(A,implies(implies(A,B),B))),
    inference(resolve,[status(thm)],[c_5397,c_1260]) ).

cnf(c_5398,plain,
    ( is_a_theorem(implies(implies(D,B),implies(A,implies(D,C))))
    | ~ is_a_theorem(implies(A,implies(B,C))) ),
    inference(resolve,[status(thm)],[c_1,c_12]) ).

cnf(c_1541,plain,
    is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))),
    inference(resolve,[status(thm)],[c_5398,c_1505]) ).

cnf(c_5399,plain,
    ( is_a_theorem(implies(B,implies(A,C)))
    | ~ is_a_theorem(implies(A,implies(B,C))) ),
    inference(resolve,[status(thm)],[c_1,c_1541]) ).

cnf(c_1711,plain,
    is_a_theorem(implies(not(A),implies(A,B))),
    inference(resolve,[status(thm)],[c_5399,c_4]) ).

cnf(c_5400,plain,
    ( is_a_theorem(implies(C,implies(implies(B,A),A)))
    | ~ is_a_theorem(implies(not(A),B)) ),
    inference(resolve,[status(thm)],[c_1,c_409]) ).

cnf(c_1741,plain,
    is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))),
    inference(resolve,[status(thm)],[c_5400,c_1711]) ).

cnf(c_5401,plain,
    ( is_a_theorem(implies(implies(C,A),D))
    | ~ is_a_theorem(implies(not(implies(implies(implies(A,B),implies(C,B)),D)),implies(implies(implies(A,B),implies(C,B)),D))) ),
    inference(resolve,[status(thm)],[c_1,c_21]) ).

cnf(c_5278,plain,
    is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))),
    inference(resolve,[status(thm)],[c_5401,c_1741]) ).

cnf(c_5402,plain,
    ( is_a_theorem(implies(A,B))
    | ~ is_a_theorem(implies(A,implies(A,B))) ),
    inference(resolve,[status(thm)],[c_1,c_5278]) ).

cnf(c_5368,plain,
    is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))),
    inference(resolve,[status(thm)],[c_5402,c_409]) ).

cnf(c_5369,plain,
    $false,
    inference(resolve,[status(thm)],[c_5368,c_5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL366-1 : TPTP v9.3.1. Bugfixed v5.5.0.
% 0.00/0.07  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44  % Computer : n014.cluster.edu
% 0.18/0.44  % Model    : x86_64 x86_64
% 0.18/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44  % Memory   : 8046.5625MB
% 0.18/0.44  % OS       : Linux 6.8.0-71-generic
% 0.18/0.44  % CPULimit : 300
% 0.18/0.45  % WCLimit  : 300
% 0.18/0.45  % DateTime : Fri Sep 25 22:19:32 UTC 2026
% 0.18/0.45  % CPUTime  : 
% 0.18/0.45  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.18/0.45  % Process 1256024 was started by sandbox2 on n014,
% 0.18/0.45  % Fri Sep 25 22:19:32 2026
% 0.18/0.45  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.18/0.46  
% 0.18/0.46  % From the command line: assign(max_seconds, 300).
% 10.69/1.88  
% 10.69/1.88  % Assigning unary symbol not kb_weight 0 and highest precedence (5).
% 10.69/1.88  
% 10.69/1.88  % SZS status Unsatisfiable for theBenchmark
% 10.69/1.88  
% 10.69/1.88  % Proof 1 at 0.95 (+ 0.45) seconds.
% 10.69/1.88  % Length of proof is 39.
% 10.69/1.88  % Level of proof is 23.
% 10.69/1.88  % Maximum clause weight is 82.000.
% 10.69/1.88  % Given clauses 201.
% 10.69/1.88  
% 10.69/1.88  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------