↑ Up

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

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

% Computer : n009.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:39 AM UTC 2026

% Result   : Unsatisfiable 0.17s 0.48s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   11 (   7 unt;   0 def)
%            Number of atoms       :   17 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   14 (   8   ~;   6   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 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   :   25 (   0 sgn   5   !;   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(prove_cn_06,axiom,
    ~ is_a_theorem(implies(implies(x,y),implies(implies(implies(x,z),u),implies(implies(y,z),u)))),
    file('theBenchmark.p',prove_cn_06) ).

cnf(c_5,plain,
    ~ is_a_theorem(implies(implies(x,y),implies(implies(implies(x,z),u),implies(implies(y,z),u)))),
    inference(clausify,[status(thm)],[prove_cn_06]) ).

cnf(c_18,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_18,c_2]) ).

cnf(c_19,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_16,plain,
    is_a_theorem(implies(implies(A,B),implies(implies(implies(A,C),D),implies(implies(B,C),D)))),
    inference(resolve,[status(thm)],[c_19,c_2]) ).

cnf(c_17,plain,
    $false,
    inference(resolve,[status(thm)],[c_16,c_5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL357-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.45  % Computer : n009.cluster.edu
% 0.17/0.45  % Model    : x86_64 x86_64
% 0.17/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.45  % Memory   : 8046.5625MB
% 0.17/0.45  % OS       : Linux 6.8.0-71-generic
% 0.17/0.45  % CPULimit : 300
% 0.17/0.45  % WCLimit  : 300
% 0.17/0.45  % DateTime : Fri Sep 25 22:18:59 UTC 2026
% 0.17/0.46  % CPUTime  : 
% 0.17/0.46  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.46  % Process 2701714 was started by sandbox on n009,
% 0.17/0.46  % Fri Sep 25 22:18:59 2026
% 0.17/0.46  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.17/0.46  
% 0.17/0.46  % From the command line: assign(max_seconds, 300).
% 0.17/0.48  
% 0.17/0.48  % SZS status Unsatisfiable for theBenchmark
% 0.17/0.48  
% 0.17/0.48  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.17/0.48  % Length of proof is 6.
% 0.17/0.48  % Level of proof is 3.
% 0.17/0.48  % Maximum clause weight is 16.000.
% 0.17/0.48  % Given clauses 6.
% 0.17/0.48  
% 0.17/0.48  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------