↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : LCL181+1 : TPTP v9.3.1. Released v2.0.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:11 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(pel4,conjecture,
    ( ( ~ p
     => q )
  <=> ( ~ q
     => p ) ),
    file('theBenchmark.p',pel4) ).

fof(pel4_neg,negated_conjecture,
    ~ ( ( ~ p
       => q )
    <=> ( ~ q
       => p ) ),
    inference(assume_negation,[status(cth)],[pel4]) ).

cnf(c_2,negated_conjecture,
    ( q
    | p ),
    inference(clausify,[status(thm)],[pel4_neg]) ).

cnf(c_3,negated_conjecture,
    ~ p,
    inference(clausify,[status(thm)],[pel4_neg]) ).

cnf(c_4,negated_conjecture,
    ~ q,
    inference(clausify,[status(thm)],[pel4_neg]) ).

cnf(c_6,negated_conjecture,
    q,
    inference(resolve,[status(thm)],[c_3,c_2]) ).

cnf(c_5,negated_conjecture,
    $false,
    inference(resolve,[status(thm)],[c_4,c_6]) ).

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