↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : LAT035-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

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

% Result   : Unsatisfiable 9.24s 2.05s
% Output   : CNFRefutation 9.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   16 (  10 unt;   0 nHn;  12 RR)
%            Number of literals    :   22 (  21 equ;  13 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :    8 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(k_on_join,axiom,
    k(join(X0,X1)) = meet(k(X0),k(X1)) ).

cnf(k_on_bottom,axiom,
    k(n0) = n1 ).

cnf(f_on_meet,axiom,
    f(meet(X0,X1)) = join(f(X0),f(X1)) ).

cnf(f_on_top,axiom,
    f(n1) = n0 ).

cnf(comp_join_hemimorphism,negated_conjecture,
    ( f(k(n0)) != n0
    | f(k(join(aa,bb))) != join(f(k(aa)),f(k(bb))) ) ).

cnf(c5,plain,
    k(join(X0,X1)) = meet(k(X0),k(X1)),
    inference(clausification,[status(esa)],[k_on_join]) ).

cnf(c7,plain,
    k(n0) = n1,
    inference(clausification,[status(esa)],[k_on_bottom]) ).

cnf(c9,plain,
    f(meet(X0,X1)) = join(f(X0),f(X1)),
    inference(clausification,[status(esa)],[f_on_meet]) ).

cnf(c10,plain,
    f(n1) = n0,
    inference(clausification,[status(esa)],[f_on_top]) ).

cnf(c11,plain,
    ( f(k(n0)) != n0
    | f(k(join(aa,bb))) != join(f(k(aa)),f(k(bb))) ),
    inference(clausification,[status(esa)],[comp_join_hemimorphism]) ).

cnf(d0,plain,
    ( f(k(join(aa,bb))) != join(f(k(aa)),f(k(bb)))
    | f(n1) != n0 ),
    inference(demodulation,[status(thm)],[c11,c7]) ).

cnf(d1,plain,
    ( f(k(join(aa,bb))) != join(f(k(aa)),f(k(bb)))
    | n0 != n0 ),
    inference(demodulation,[status(thm)],[d0,c10]) ).

cnf(d2,plain,
    ( f(k(join(aa,bb))) != f(meet(k(aa),k(bb)))
    | n0 != n0 ),
    inference(demodulation,[status(thm)],[d1,c9]) ).

cnf(d3,plain,
    ( f(k(join(aa,bb))) != f(k(join(aa,bb)))
    | n0 != n0 ),
    inference(demodulation,[status(thm)],[d2,c5]) ).

cnf(d4,plain,
    n0 != n0,
    inference(equality_resolution,[status(thm)],[d3]) ).

cnf(d5,plain,
    $false,
    inference(equality_resolution,[status(thm)],[d4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LAT035-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n020.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 19:59:18 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.24/2.05  % SZS status Unsatisfiable for theBenchmark.p
% 9.24/2.05  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------