↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : LCL175-3 : 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 : n001.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:10 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(rule_1,axiom,
    ! [VAR_0] :
      ( ~ axiom(VAR_0)
      | theorem(VAR_0) ),
    file('theBenchmark.p',rule_1) ).

cnf(c_1,plain,
    ( ~ axiom(A)
    | theorem(A) ),
    inference(clausify,[status(thm)],[rule_1]) ).

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

cnf(c_5,plain,
    axiom(implies(A,or(B,A))),
    inference(clausify,[status(thm)],[axiom_1_3]) ).

cnf(c_8,plain,
    theorem(implies(A,or(B,A))),
    inference(resolve,[status(thm)],[c_1,c_5]) ).

fof(prove_this,axiom,
    ~ theorem(implies(p,or(p,p))),
    file('theBenchmark.p',prove_this) ).

cnf(c_12,plain,
    ~ theorem(implies(p,or(p,p))),
    inference(clausify,[status(thm)],[prove_this]) ).

cnf(c_13,plain,
    $false,
    inference(resolve,[status(thm)],[c_12,c_8]) ).

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