↑ Up

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

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

% Result   : Unsatisfiable 6.97s 1.37s
% Output   : CNFRefutation 6.97s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   39 (  23 unt;   0 def)
%            Number of atoms       :   57 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   38 (  20   ~;  18   |;   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    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :  110 (  14 sgn   9   !;   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(ic_2,axiom,
    ! [VAR_0,VAR_1] : is_a_theorem(implies(VAR_0,implies(VAR_1,VAR_0))),
    file('theBenchmark.p',ic_2) ).

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

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

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

fof(ic_4,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',ic_4) ).

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

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

cnf(c_5,plain,
    ~ is_a_theorem(implies(implies(implies(a,b),c),implies(implies(c,a),implies(e,a)))),
    inference(clausify,[status(thm)],[prove_ic_JLukasiewicz]) ).

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

cnf(c_8,plain,
    is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))),
    inference(resolve,[status(thm)],[c_3562,c_4]) ).

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

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

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

cnf(c_17,plain,
    is_a_theorem(implies(A,implies(implies(A,B),implies(C,B)))),
    inference(resolve,[status(thm)],[c_3564,c_4]) ).

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

cnf(c_36,plain,
    is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(A,D))),
    inference(resolve,[status(thm)],[c_3565,c_17]) ).

cnf(c_3566,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_8]) ).

cnf(c_770,plain,
    is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,implies(D,C))))),
    inference(resolve,[status(thm)],[c_3566,c_36]) ).

cnf(c_3567,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_8]) ).

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

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

cnf(c_784,plain,
    is_a_theorem(implies(A,implies(implies(A,B),B))),
    inference(resolve,[status(thm)],[c_3568,c_778]) ).

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

cnf(c_820,plain,
    is_a_theorem(implies(implies(implies(implies(A,B),B),C),implies(A,C))),
    inference(resolve,[status(thm)],[c_3569,c_784]) ).

cnf(c_3570,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_8]) ).

cnf(c_1297,plain,
    is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))),
    inference(resolve,[status(thm)],[c_3570,c_820]) ).

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

cnf(c_1310,plain,
    is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))),
    inference(resolve,[status(thm)],[c_3571,c_8]) ).

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

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

cnf(c_3573,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_8]) ).

cnf(c_2417,plain,
    is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),A))),
    inference(resolve,[status(thm)],[c_3573,c_1431]) ).

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

cnf(c_2445,plain,
    is_a_theorem(implies(implies(A,B),implies(implies(implies(B,C),A),B))),
    inference(resolve,[status(thm)],[c_3574,c_2417]) ).

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

cnf(c_3560,plain,
    is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),implies(D,A)))),
    inference(resolve,[status(thm)],[c_3575,c_2445]) ).

cnf(c_3561,plain,
    $false,
    inference(resolve,[status(thm)],[c_3560,c_5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL080-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.42  % Computer : n019.cluster.edu
% 0.16/0.42  % Model    : x86_64 x86_64
% 0.16/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42  % Memory   : 8046.5625MB
% 0.16/0.42  % OS       : Linux 6.8.0-71-generic
% 0.16/0.42  % CPULimit : 300
% 0.16/0.42  % WCLimit  : 300
% 0.16/0.42  % DateTime : Fri Sep 25 21:49:34 UTC 2026
% 0.16/0.42  % CPUTime  : 
% 0.16/0.42  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.16/0.42  % Process 3806964 was started by sandbox2 on n019,
% 0.16/0.42  % Fri Sep 25 21:49:34 2026
% 0.16/0.42  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.16/0.43  
% 0.16/0.43  % From the command line: assign(max_seconds, 300).
% 6.97/1.37  
% 6.97/1.37  % SZS status Unsatisfiable for theBenchmark
% 6.97/1.37  
% 6.97/1.37  % Proof 1 at 0.65 (+ 0.28) seconds.
% 6.97/1.37  % Length of proof is 20.
% 6.97/1.37  % Level of proof is 11.
% 6.97/1.37  % Maximum clause weight is 41.000.
% 6.97/1.37  % Given clauses 116.
% 6.97/1.37  
% 6.97/1.37  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------