↑ Up

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

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

% Computer : n007.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:44 AM UTC 2026

% Result   : Unsatisfiable 2.67s 0.75s
% Output   : CNFRefutation 2.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   55 (  31 unt;   0 def)
%            Number of atoms       :   81 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   54 (  28   ~;  26   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :  147 (  30 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_38,axiom,
    ~ is_a_theorem(implies(implies(x,not(x)),not(x))),
    file('theBenchmark.p',prove_cn_38) ).

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

cnf(c_2874,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_2874,c_2]) ).

cnf(c_2875,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_2875,c_3]) ).

cnf(c_2876,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_2876,c_4]) ).

cnf(c_2877,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_2877,c_6]) ).

cnf(c_2878,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_20,plain,
    is_a_theorem(implies(implies(implies(implies(not(A),A),B),C),implies(implies(A,B),C))),
    inference(resolve,[status(thm)],[c_2878,c_7]) ).

cnf(c_2879,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_29,plain,
    is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))),
    inference(resolve,[status(thm)],[c_2879,c_9]) ).

cnf(c_2880,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_34,plain,
    is_a_theorem(implies(A,A)),
    inference(resolve,[status(thm)],[c_2880,c_3]) ).

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

cnf(c_36,plain,
    is_a_theorem(implies(not(implies(A,A)),B)),
    inference(resolve,[status(thm)],[c_2881,c_34]) ).

cnf(c_2882,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_43,plain,
    is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))),
    inference(resolve,[status(thm)],[c_2882,c_29]) ).

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

cnf(c_44,plain,
    is_a_theorem(implies(A,implies(not(implies(B,B)),C))),
    inference(resolve,[status(thm)],[c_2883,c_36]) ).

cnf(c_2884,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_127,plain,
    is_a_theorem(implies(implies(A,implies(not(B),B)),implies(implies(B,C),implies(A,C)))),
    inference(resolve,[status(thm)],[c_2884,c_7]) ).

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

cnf(c_184,plain,
    is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))),
    inference(resolve,[status(thm)],[c_2885,c_44]) ).

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

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

cnf(c_2887,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_415,plain,
    is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))),
    inference(resolve,[status(thm)],[c_2887,c_205]) ).

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

cnf(c_907,plain,
    is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))),
    inference(resolve,[status(thm)],[c_2888,c_415]) ).

cnf(c_2889,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_939,plain,
    is_a_theorem(implies(A,implies(B,implies(C,A)))),
    inference(resolve,[status(thm)],[c_2889,c_907]) ).

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

cnf(c_980,plain,
    is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))),
    inference(resolve,[status(thm)],[c_2890,c_939]) ).

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

cnf(c_1092,plain,
    is_a_theorem(implies(not(A),implies(B,implies(A,C)))),
    inference(resolve,[status(thm)],[c_2891,c_907]) ).

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

cnf(c_1111,plain,
    is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))),
    inference(resolve,[status(thm)],[c_2892,c_1092]) ).

cnf(c_2893,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_415]) ).

cnf(c_1207,plain,
    is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))),
    inference(resolve,[status(thm)],[c_2893,c_1111]) ).

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

cnf(c_2831,plain,
    is_a_theorem(implies(implies(implies(A,B),A),A)),
    inference(resolve,[status(thm)],[c_2894,c_1207]) ).

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

cnf(c_2872,plain,
    is_a_theorem(implies(implies(A,not(A)),not(A))),
    inference(resolve,[status(thm)],[c_2895,c_2831]) ).

cnf(c_2873,plain,
    $false,
    inference(resolve,[status(thm)],[c_2872,c_5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL379-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.34  % Computer : n007.cluster.edu
% 0.08/0.34  % Model    : x86_64 x86_64
% 0.08/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34  % Memory   : 8046.5625MB
% 0.08/0.34  % OS       : Linux 6.8.0-71-generic
% 0.08/0.34  % CPULimit : 300
% 0.08/0.34  % WCLimit  : 300
% 0.08/0.34  % DateTime : Fri Sep 25 22:21:09 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.35  % Process 2062229 was started by sandbox2 on n007,
% 0.08/0.35  % Fri Sep 25 22:21:09 2026
% 0.08/0.35  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.35  
% 0.08/0.35  % From the command line: assign(max_seconds, 300).
% 2.67/0.75  
% 2.67/0.75  % SZS status Unsatisfiable for theBenchmark
% 2.67/0.75  
% 2.67/0.75  % Proof 1 at 0.28 (+ 0.10) seconds.
% 2.67/0.75  % Length of proof is 28.
% 2.67/0.75  % Level of proof is 16.
% 2.67/0.75  % Maximum clause weight is 45.000.
% 2.67/0.75  % Given clauses 130.
% 2.67/0.75  
% 2.67/0.75  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------