↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Prover9---2026-6A
% Problem  : LAT034-1 : TPTP v9.3.1. Bugfixed v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : prover9 -casc 300 -f /export/starexec/sandbox2/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:49:35 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(absorption1,axiom,
    ! [VAR_0,VAR_1] : meet(VAR_0,join(VAR_0,VAR_1)) = VAR_0,
    file('theBenchmark.p',absorption1) ).

cnf(c_1,plain,
    meet(A,join(A,B)) = A,
    inference(clausify,[status(thm)],[absorption1]) ).

fof(absorption2,axiom,
    ! [VAR_0,VAR_1] : join(VAR_0,meet(VAR_0,VAR_1)) = VAR_0,
    file('theBenchmark.p',absorption2) ).

cnf(c_2,plain,
    join(A,meet(A,B)) = A,
    inference(clausify,[status(thm)],[absorption2]) ).

fof(idempotence_of_meet,axiom,
    meet(xx,xx) != xx,
    file('theBenchmark.p',idempotence_of_meet) ).

cnf(c_7,plain,
    meet(xx,xx) != xx,
    inference(clausify,[status(thm)],[idempotence_of_meet]) ).

cnf(c_8,plain,
    meet(A,A) = A,
    inference(paramod,[status(thm)],[c_2,c_1]) ).

cnf(c_9,plain,
    $false,
    inference(resolve,[status(thm)],[c_8,c_7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LAT034-1 : TPTP v9.3.1. Bugfixed v2.5.0.
% 0.00/0.07  % Command  : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  % Computer : n001.cluster.edu
% 0.19/0.46  % Model    : x86_64 x86_64
% 0.19/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46  % Memory   : 8046.5625MB
% 0.19/0.46  % OS       : Linux 6.8.0-71-generic
% 0.19/0.46  % CPULimit : 300
% 0.19/0.46  % WCLimit  : 300
% 0.19/0.46  % DateTime : Fri Sep 25 20:04:11 UTC 2026
% 0.19/0.46  % CPUTime  : 
% 0.19/0.46  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.19/0.46  % Process 4095902 was started by sandbox2 on n001,
% 0.19/0.46  % Fri Sep 25 20:04:11 2026
% 0.19/0.46  % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.19/0.47  
% 0.19/0.47  % From the command line: assign(max_seconds, 300).
% 0.19/0.48  
% 0.19/0.48  % SZS status Unsatisfiable for theBenchmark
% 0.19/0.48  
% 0.19/0.48  % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.19/0.48  % Length of proof is 5.
% 0.19/0.48  % Level of proof is 2.
% 0.19/0.48  % Maximum clause weight is 7.000.
% 0.19/0.48  % Given clauses 2.
% 0.19/0.48  
% 0.19/0.48  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------