↑ Up

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

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

% Computer : n018.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:57:53 AM UTC 2026

% Result   : Unsatisfiable 0.15s 5.62s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   25 (  15 unt;   0 def)
%            Number of atoms       :   37 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   26 (  14   ~;  12   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   61 (  10 sgn   7   !;   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_18,axiom,
    ! [VAR_0,VAR_1] : is_a_theorem(implies(VAR_0,implies(VAR_1,VAR_0))),
    file('theBenchmark.p',cn_18) ).

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

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

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

fof(prove_cn_1,axiom,
    ~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
    file('theBenchmark.p',prove_cn_1) ).

cnf(c_4,plain,
    ~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
    inference(clausify,[status(thm)],[prove_cn_1]) ).

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

cnf(c_5,plain,
    is_a_theorem(implies(A,implies(B,implies(C,B)))),
    inference(resolve,[status(thm)],[c_183,c_2]) ).

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

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

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

cnf(c_7,plain,
    is_a_theorem(implies(A,implies(implies(B,implies(C,D)),implies(implies(B,C),implies(B,D))))),
    inference(resolve,[status(thm)],[c_185,c_3]) ).

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

cnf(c_13,plain,
    is_a_theorem(implies(implies(A,implies(implies(B,A),C)),implies(A,C))),
    inference(resolve,[status(thm)],[c_186,c_5]) ).

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

cnf(c_131,plain,
    is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))),
    inference(resolve,[status(thm)],[c_187,c_7]) ).

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

cnf(c_145,plain,
    is_a_theorem(implies(implies(implies(A,B),implies(C,A)),implies(implies(A,B),implies(C,B)))),
    inference(resolve,[status(thm)],[c_188,c_131]) ).

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

cnf(c_174,plain,
    is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))),
    inference(resolve,[status(thm)],[c_189,c_5]) ).

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

cnf(c_181,plain,
    is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))),
    inference(resolve,[status(thm)],[c_190,c_145]) ).

cnf(c_182,plain,
    $false,
    inference(resolve,[status(thm)],[c_181,c_4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL064-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/5.58  % Computer : n018.cluster.edu
% 0.11/5.58  % Model    : x86_64 x86_64
% 0.11/5.58  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.58  % Memory   : 8046.5625MB
% 0.11/5.58  % OS       : Linux 6.8.0-71-generic
% 0.11/5.58  % CPULimit : 300
% 0.11/5.58  % WCLimit  : 300
% 0.11/5.58  % DateTime : Fri Sep 25 21:50:26 UTC 2026
% 0.11/5.58  % CPUTime  : 
% 0.11/5.58  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/5.58  % Process 2922377 was started by sandbox2 on n018,
% 0.11/5.58  % Fri Sep 25 21:50:26 2026
% 0.11/5.58  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.11/5.59  
% 0.11/5.59  % From the command line: assign(max_seconds, 300).
% 0.15/5.62  
% 0.15/5.62  % SZS status Unsatisfiable for theBenchmark
% 0.15/5.62  
% 0.15/5.62  % Proof 1 at 0.02 (+ 0.01) seconds.
% 0.15/5.62  % Length of proof is 13.
% 0.15/5.62  % Level of proof is 7.
% 0.15/5.62  % Maximum clause weight is 45.000.
% 0.15/5.62  % Given clauses 34.
% 0.15/5.62  
% 0.15/5.62  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------