↑ Up

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

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

% Computer : n008.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:44 AM UTC 2026

% Result   : Unsatisfiable 6.21s 1.27s
% Output   : CNFRefutation 6.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   34 (  34 unt;   0 def)
%            Number of atoms       :   34 (  33 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   78 (  11 sgn  18   !;   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_3,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_4,plain,
    join(A,meet(A,B)) = A,
    inference(clausify,[status(thm)],[absorption2]) ).

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

cnf(c_5,plain,
    meet(A,B) = meet(B,A),
    inference(clausify,[status(thm)],[commutativity_of_meet]) ).

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

cnf(c_6,plain,
    join(A,B) = join(B,A),
    inference(clausify,[status(thm)],[commutativity_of_join]) ).

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

cnf(c_7,plain,
    meet(meet(A,B),C) = meet(A,meet(B,C)),
    inference(clausify,[status(thm)],[associativity_of_meet]) ).

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

cnf(c_8,plain,
    join(join(A,B),C) = join(A,join(B,C)),
    inference(clausify,[status(thm)],[associativity_of_join]) ).

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

cnf(c_9,plain,
    meet(A,join(B,meet(C,join(A,D)))) = meet(A,join(B,meet(C,join(D,meet(C,join(A,B)))))),
    inference(clausify,[status(thm)],[equation_H40]) ).

cnf(c_10,plain,
    meet(A,join(B,meet(C,join(D,meet(C,join(A,B)))))) = meet(A,join(B,meet(C,join(A,D)))),
    inference(copy,[status(thm)],[c_9]) ).

fof(prove_H6,axiom,
    meet(a,join(b,meet(a,c))) != meet(a,join(meet(a,join(b,meet(a,c))),meet(c,join(a,b)))),
    file('theBenchmark.p',prove_H6) ).

cnf(c_11,plain,
    meet(a,join(b,meet(a,c))) != meet(a,join(meet(a,join(b,meet(a,c))),meet(c,join(a,b)))),
    inference(clausify,[status(thm)],[prove_H6]) ).

cnf(c_12,plain,
    meet(a,join(meet(a,join(b,meet(a,c))),meet(c,join(a,b)))) != meet(a,join(b,meet(a,c))),
    inference(copy,[status(thm)],[c_11]) ).

cnf(c_13,plain,
    join(A,meet(B,A)) = A,
    inference(paramod,[status(thm)],[c_5,c_4]) ).

cnf(c_14,plain,
    meet(A,join(B,A)) = A,
    inference(paramod,[status(thm)],[c_6,c_3]) ).

cnf(c_2230,plain,
    join(A,B) = join(A,join(meet(A,C),B)),
    inference(paramod,[status(thm)],[c_4,c_8]) ).

cnf(c_28,plain,
    join(A,join(meet(A,B),C)) = join(A,C),
    inference(copy,[status(thm)],[c_2230]) ).

cnf(c_36,plain,
    meet(A,join(meet(A,B),meet(C,join(D,meet(C,A))))) = meet(A,join(meet(A,B),meet(C,join(A,D)))),
    inference(paramod,[status(thm)],[c_4,c_10]) ).

cnf(c_2231,plain,
    meet(A,B) = meet(A,meet(B,join(C,meet(A,B)))),
    inference(paramod,[status(thm)],[c_14,c_7]) ).

cnf(c_57,plain,
    meet(A,meet(B,join(C,meet(A,B)))) = meet(A,B),
    inference(copy,[status(thm)],[c_2231]) ).

cnf(c_2232,plain,
    meet(join(meet(A,B),C),join(A,C)) = join(meet(A,B),C),
    inference(paramod,[status(thm)],[c_28,c_14]) ).

cnf(c_270,plain,
    meet(join(A,B),join(meet(A,C),B)) = join(meet(A,C),B),
    inference(paramod,[status(thm)],[c_5,c_2232]) ).

cnf(c_2233,plain,
    meet(a,join(meet(a,join(b,meet(a,c))),meet(c,join(b,meet(c,a))))) != meet(a,join(b,meet(a,c))),
    inference(paramod,[status(thm)],[c_36,c_12]) ).

cnf(c_489,plain,
    meet(a,join(meet(a,join(b,meet(a,c))),meet(c,join(b,meet(a,c))))) != meet(a,join(b,meet(a,c))),
    inference(paramod,[status(thm)],[c_5,c_2233]) ).

cnf(c_1087,plain,
    meet(A,join(meet(A,B),meet(C,A))) = join(meet(A,B),meet(C,A)),
    inference(paramod,[status(thm)],[c_13,c_270]) ).

cnf(c_2183,plain,
    meet(A,join(meet(B,C),meet(A,B))) = meet(A,B),
    inference(paramod,[status(thm)],[c_1087,c_57]) ).

cnf(c_2192,plain,
    meet(A,join(meet(B,C),meet(A,C))) = meet(A,C),
    inference(paramod,[status(thm)],[c_5,c_2183]) ).

cnf(c_2228,plain,
    meet(A,join(meet(A,B),meet(C,B))) = meet(A,B),
    inference(paramod,[status(thm)],[c_6,c_2192]) ).

cnf(c_2229,plain,
    $false,
    inference(resolve,[status(thm)],[c_2228,c_489]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LAT152-1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.37  % Computer : n008.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Fri Sep 25 20:09:27 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.38  % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.38  % Process 1773276 was started by sandbox on n008,
% 0.10/0.38  % Fri Sep 25 20:09:27 2026
% 0.10/0.38  % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.38  
% 0.10/0.38  % From the command line: assign(max_seconds, 300).
% 6.21/1.27  
% 6.21/1.27  % SZS status Unsatisfiable for theBenchmark
% 6.21/1.27  
% 6.21/1.27  % Proof 1 at 0.67 (+ 0.17) seconds.
% 6.21/1.27  % Length of proof is 22.
% 6.21/1.27  % Level of proof is 7.
% 6.21/1.27  % Maximum clause weight is 58.000.
% 6.21/1.27  % Given clauses 99.
% 6.21/1.27  
% 6.21/1.27  % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------