↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : GRP166-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n015.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:23:17 AM UTC 2026

% Result   : Unsatisfiable 46.57s 10.64s
% Output   : CNFRefutation 46.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   43 (  43 unt;   0 nHn;  13 RR)
%            Number of literals    :   43 (  42 equ;   6 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   56 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(lat2b_1,hypothesis,
    'greatest$ulower$ubound'(a,identity) = identity ).

cnf(lat2b_2,hypothesis,
    'greatest$ulower$ubound'(b,identity) = identity ).

cnf(prove_lat2b,negated_conjecture,
    'greatest$ulower$ubound'(a,multiply(a,b)) != a ).

cnf(left_identity,axiom,
    multiply(identity,X0) = X0 ).

cnf(left_inverse,axiom,
    multiply(inverse(X0),X0) = identity ).

cnf(associativity,axiom,
    multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)) ).

cnf(symmetry_of_glb,axiom,
    'greatest$ulower$ubound'(X0,X1) = 'greatest$ulower$ubound'(X1,X0) ).

cnf(associativity_of_glb,axiom,
    'greatest$ulower$ubound'(X0,'greatest$ulower$ubound'(X1,X2)) = 'greatest$ulower$ubound'('greatest$ulower$ubound'(X0,X1),X2) ).

cnf(lub_absorbtion,axiom,
    'least$uupper$ubound'(X0,'greatest$ulower$ubound'(X0,X1)) = X0 ).

cnf(monotony_glb1,axiom,
    multiply(X0,'greatest$ulower$ubound'(X1,X2)) = 'greatest$ulower$ubound'(multiply(X0,X1),multiply(X0,X2)) ).

cnf(c0,plain,
    'greatest$ulower$ubound'(a,identity) = identity,
    inference(clausification,[status(esa)],[lat2b_1]) ).

cnf(c1,plain,
    'greatest$ulower$ubound'(b,identity) = identity,
    inference(clausification,[status(esa)],[lat2b_2]) ).

cnf(c2,plain,
    'greatest$ulower$ubound'(a,multiply(a,b)) != a,
    inference(clausification,[status(esa)],[prove_lat2b]) ).

cnf(c3,plain,
    multiply(identity,X0) = X0,
    inference(clausification,[status(esa)],[left_identity]) ).

cnf(c4,plain,
    multiply(inverse(X0),X0) = identity,
    inference(clausification,[status(esa)],[left_inverse]) ).

cnf(c5,plain,
    multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
    inference(clausification,[status(esa)],[associativity]) ).

cnf(c6,plain,
    'greatest$ulower$ubound'(X0,X1) = 'greatest$ulower$ubound'(X1,X0),
    inference(clausification,[status(esa)],[symmetry_of_glb]) ).

cnf(c8,plain,
    'greatest$ulower$ubound'(X0,'greatest$ulower$ubound'(X1,X2)) = 'greatest$ulower$ubound'('greatest$ulower$ubound'(X0,X1),X2),
    inference(clausification,[status(esa)],[associativity_of_glb]) ).

cnf(c12,plain,
    'least$uupper$ubound'(X0,'greatest$ulower$ubound'(X0,X1)) = X0,
    inference(clausification,[status(esa)],[lub_absorbtion]) ).

cnf(c15,plain,
    multiply(X0,'greatest$ulower$ubound'(X1,X2)) = 'greatest$ulower$ubound'(multiply(X0,X1),multiply(X0,X2)),
    inference(clausification,[status(esa)],[monotony_glb1]) ).

cnf(d0,plain,
    multiply(identity,X1) = multiply(inverse(X0),multiply(X0,X1)),
    inference(superposition,[status(thm)],[c4,c5]) ).

cnf(d1,plain,
    X0 = multiply(inverse(X1),multiply(X1,X0)),
    inference(demodulation,[status(thm)],[d0,c3]) ).

cnf(d2,plain,
    multiply(X0,X1) = multiply(inverse(inverse(X0)),X1),
    inference(superposition,[status(thm)],[d1,d1]) ).

cnf(d3,plain,
    X0 = multiply(inverse(inverse(X0)),identity),
    inference(superposition,[status(thm)],[c4,d1]) ).

cnf(d4,plain,
    X0 = multiply(X0,identity),
    inference(demodulation,[status(thm)],[d3,d2]) ).

cnf(d5,plain,
    'greatest$ulower$ubound'(identity,b) = identity,
    inference(demodulation,[status(thm)],[c1,c6]) ).

cnf(d6,plain,
    multiply(X0,identity) = inverse(inverse(X0)),
    inference(superposition,[status(thm)],[d4,d2]) ).

cnf(d7,plain,
    X0 = inverse(inverse(X0)),
    inference(demodulation,[status(thm)],[d6,d4]) ).

cnf(d8,plain,
    multiply(inverse(inverse(X0)),'greatest$ulower$ubound'(X1,identity)) = 'greatest$ulower$ubound'(multiply(inverse(inverse(X0)),X1),X0),
    inference(superposition,[status(thm)],[d3,c15]) ).

cnf(d9,plain,
    multiply(X0,'greatest$ulower$ubound'(X1,identity)) = 'greatest$ulower$ubound'(multiply(inverse(inverse(X0)),X1),X0),
    inference(demodulation,[status(thm)],[d8,d7]) ).

cnf(d10,plain,
    multiply(X0,'greatest$ulower$ubound'(X1,identity)) = 'greatest$ulower$ubound'(X0,multiply(inverse(inverse(X0)),X1)),
    inference(demodulation,[status(thm)],[d9,c6]) ).

cnf(d11,plain,
    multiply(X0,'greatest$ulower$ubound'(X1,identity)) = 'greatest$ulower$ubound'(X0,multiply(X0,X1)),
    inference(demodulation,[status(thm)],[d10,d7]) ).

cnf(d12,plain,
    multiply(a,'greatest$ulower$ubound'(b,identity)) != a,
    inference(demodulation,[status(thm)],[c2,d11]) ).

cnf(d13,plain,
    multiply(a,'greatest$ulower$ubound'(identity,b)) != a,
    inference(demodulation,[status(thm)],[d12,c6]) ).

cnf(d14,plain,
    multiply(a,identity) != a,
    inference(demodulation,[status(thm)],[d13,d5]) ).

cnf(d15,plain,
    a != a,
    inference(demodulation,[status(thm)],[d14,d4]) ).

cnf(d16,plain,
    'least$uupper$ubound'(X0,'greatest$ulower$ubound'(X1,X0)) = X0,
    inference(superposition,[status(thm)],[c6,c12]) ).

cnf(d17,plain,
    'least$uupper$ubound'(X2,'greatest$ulower$ubound'(X0,'greatest$ulower$ubound'(X1,X2))) = X2,
    inference(superposition,[status(thm)],[c8,d16]) ).

cnf(d18,plain,
    'greatest$ulower$ubound'(identity,a) = identity,
    inference(demodulation,[status(thm)],[c0,c6]) ).

cnf(d19,plain,
    'greatest$ulower$ubound'(identity,'greatest$ulower$ubound'(a,X0)) = 'greatest$ulower$ubound'(identity,X0),
    inference(superposition,[status(thm)],[d18,c8]) ).

cnf(d20,plain,
    'least$uupper$ubound'(X0,'greatest$ulower$ubound'(identity,X0)) = X0,
    inference(superposition,[status(thm)],[d19,d17]) ).

cnf(d21,plain,
    X0 = X0,
    inference(demodulation,[status(thm)],[d20,d16]) ).

cnf(d22,plain,
    $false,
    inference(resolution,[status(thm)],[d21,d15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : GRP166-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.06  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.16/0.41  % Computer : n015.cluster.edu
% 0.16/0.41  % Model    : x86_64 x86_64
% 0.16/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.41  % Memory   : 8046.5625MB
% 0.16/0.41  % OS       : Linux 6.8.0-71-generic
% 0.16/0.41  % CPULimit : 300
% 0.16/0.41  % WCLimit  : 300
% 0.16/0.41  % DateTime : Fri Sep 25 14:35:57 UTC 2026
% 0.16/0.41  % CPUTime  : 
% 0.16/0.41  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 46.57/10.64  % SZS status Unsatisfiable for theBenchmark.p
% 46.57/10.64  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------