↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : LCL111-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox/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:58:01 AM UTC 2026

% Result   : Unsatisfiable 0.11s 0.44s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (  15 unt;   0 def)
%            Number of atoms       :   15 (  14 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    2 (   2   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   32 (   0 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(wajsberg_1,axiom,
    ! [VAR_0] : implies(truth,VAR_0) = VAR_0,
    file('theBenchmark.p',wajsberg_1) ).

cnf(c_1,plain,
    implies(truth,A) = A,
    inference(clausify,[status(thm)],[wajsberg_1]) ).

fof(wajsberg_2,axiom,
    ! [VAR_0,VAR_1,VAR_2] : implies(implies(VAR_0,VAR_1),implies(implies(VAR_1,VAR_2),implies(VAR_0,VAR_2))) = truth,
    file('theBenchmark.p',wajsberg_2) ).

cnf(c_2,plain,
    implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth,
    inference(clausify,[status(thm)],[wajsberg_2]) ).

fof(prove_mv_25,axiom,
    implies(implies(x,y),implies(implies(z,x),implies(z,y))) != truth,
    file('theBenchmark.p',prove_mv_25) ).

cnf(c_5,plain,
    implies(implies(x,y),implies(implies(z,x),implies(z,y))) != truth,
    inference(clausify,[status(thm)],[prove_mv_25]) ).

cnf(c_555,plain,
    implies(A,implies(implies(A,B),implies(truth,B))) = truth,
    inference(paramod,[status(thm)],[c_1,c_2]) ).

cnf(c_6,plain,
    implies(A,implies(implies(A,B),B)) = truth,
    inference(paramod,[status(thm)],[c_1,c_555]) ).

cnf(c_556,plain,
    implies(truth,implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))) = truth,
    inference(paramod,[status(thm)],[c_2,c_2]) ).

cnf(c_8,plain,
    implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D)) = truth,
    inference(paramod,[status(thm)],[c_1,c_556]) ).

cnf(c_557,plain,
    implies(truth,implies(implies(implies(implies(A,B),B),C),implies(A,C))) = truth,
    inference(paramod,[status(thm)],[c_6,c_2]) ).

cnf(c_29,plain,
    implies(implies(implies(implies(A,B),B),C),implies(A,C)) = truth,
    inference(paramod,[status(thm)],[c_1,c_557]) ).

cnf(c_558,plain,
    implies(truth,implies(implies(A,B),implies(implies(C,A),implies(C,B)))) = truth,
    inference(paramod,[status(thm)],[c_8,c_29]) ).

cnf(c_553,plain,
    implies(implies(A,B),implies(implies(C,A),implies(C,B))) = truth,
    inference(paramod,[status(thm)],[c_1,c_558]) ).

cnf(c_554,plain,
    $false,
    inference(resolve,[status(thm)],[c_553,c_5]) ).

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