↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : LCL079-1 : 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 : 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:57:55 AM UTC 2026

% Result   : Unsatisfiable 0.09s 0.39s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   19 (  14 unt;   0 def)
%            Number of atoms       :   26 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   16 (   9   ~;   7   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    4 (   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   :   22 (   3 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(a_implies_b,axiom,
    is_a_theorem(implies(a,b)),
    file('theBenchmark.p',a_implies_b) ).

cnf(c_5,plain,
    is_a_theorem(implies(a,b)),
    inference(clausify,[status(thm)],[a_implies_b]) ).

fof(b_implies_c,axiom,
    is_a_theorem(implies(b,c)),
    file('theBenchmark.p',b_implies_c) ).

cnf(c_6,plain,
    is_a_theorem(implies(b,c)),
    inference(clausify,[status(thm)],[b_implies_c]) ).

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

cnf(c_7,plain,
    ~ is_a_theorem(implies(a,c)),
    inference(clausify,[status(thm)],[prove_transitivity]) ).

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

cnf(c_20,plain,
    is_a_theorem(implies(A,implies(b,c))),
    inference(resolve,[status(thm)],[c_87,c_6]) ).

cnf(c_88,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_32,plain,
    is_a_theorem(implies(implies(A,b),implies(A,c))),
    inference(resolve,[status(thm)],[c_88,c_20]) ).

cnf(c_89,plain,
    ( is_a_theorem(implies(A,c))
    | ~ is_a_theorem(implies(A,b)) ),
    inference(resolve,[status(thm)],[c_1,c_32]) ).

cnf(c_85,plain,
    is_a_theorem(implies(a,c)),
    inference(resolve,[status(thm)],[c_89,c_5]) ).

cnf(c_86,plain,
    $false,
    inference(resolve,[status(thm)],[c_85,c_7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL079-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n014.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Fri Sep 25 21:49:17 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37  % Process 1184381 was started by sandbox2 on n014,
% 0.09/0.37  % Fri Sep 25 21:49:17 2026
% 0.09/0.37  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.37  
% 0.09/0.37  % From the command line: assign(max_seconds, 300).
% 0.09/0.39  
% 0.09/0.39  % SZS status Unsatisfiable for theBenchmark
% 0.09/0.39  
% 0.09/0.39  % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.09/0.39  % Length of proof is 10.
% 0.09/0.39  % Level of proof is 4.
% 0.09/0.39  % Maximum clause weight is 14.000.
% 0.09/0.39  % Given clauses 29.
% 0.09/0.39  
% 0.09/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------