↑ Up

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

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

% Computer : n004.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 08:26:59 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(absorbtion,axiom,
    add(c,d) = d,
    file('theBenchmark.p',absorbtion) ).

cnf(c_4,plain,
    add(c,d) = d,
    inference(clausify,[status(thm)],[absorbtion]) ).

fof(prove_absorption_within_negation,axiom,
    ! [VAR_0,VAR_1] : negate(add(VAR_0,VAR_1)) != negate(VAR_1),
    file('theBenchmark.p',prove_absorption_within_negation) ).

cnf(c_5,plain,
    negate(add(A,B)) != negate(B),
    inference(clausify,[status(thm)],[prove_absorption_within_negation]) ).

cnf(c_30,plain,
    negate(d) != negate(d),
    inference(paramod,[status(thm)],[c_4,c_5]) ).

cnf(c_29,plain,
    $false,
    inference(copy,[status(thm)],[c_30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ROB030-1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.37  % Computer : n004.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sat Sep 26 06:16:51 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/0.38  % Process 986421 was started by sandbox2 on n004,
% 0.11/0.38  % Sat Sep 26 06:16:51 2026
% 0.11/0.38  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.11/0.38  
% 0.11/0.38  % From the command line: assign(max_seconds, 300).
% 0.11/0.39  
% 0.11/0.39  % SZS status Unsatisfiable for theBenchmark
% 0.11/0.39  
% 0.11/0.39  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.11/0.39  % Length of proof is 3.
% 0.11/0.39  % Level of proof is 1.
% 0.11/0.39  % Maximum clause weight is 22.000.
% 0.11/0.39  % Given clauses 5.
% 0.11/0.39  
% 0.11/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------