↑ Up

LisaST---0.9.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : LisaST---0.9
% Problem  : GRP186-3 : 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 : n011.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:23 AM UTC 2026

% Result   : Unsatisfiable 102.25s 36.08s
% Output   : CNFRefutation 102.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   36 (  36 unt;   0 nHn;   6 RR)
%            Number of literals    :   36 (  35 equ;   5 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   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   :   62 (   7 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_p23x,negated_conjecture,
    'least$uupper$ubound'(multiply(a,b),identity) != multiply(a,'least$uupper$ubound'(inverse(a),b)) ).

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(symmetry_of_lub,axiom,
    'least$uupper$ubound'(X0,X1) = 'least$uupper$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_lub1,axiom,
    multiply(X0,'least$uupper$ubound'(X1,X2)) = 'least$uupper$ubound'(multiply(X0,X1),multiply(X0,X2)) ).

cnf(c0,plain,
    'least$uupper$ubound'(multiply(a,b),identity) != multiply(a,'least$uupper$ubound'(inverse(a),b)),
    inference(clausification,[status(esa)],[prove_p23x]) ).

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

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

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

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

cnf(c5,plain,
    'least$uupper$ubound'(X0,X1) = 'least$uupper$ubound'(X1,X0),
    inference(clausification,[status(esa)],[symmetry_of_lub]) ).

cnf(c6,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(c10,plain,
    'least$uupper$ubound'(X0,'greatest$ulower$ubound'(X0,X1)) = X0,
    inference(clausification,[status(esa)],[lub_absorbtion]) ).

cnf(c12,plain,
    multiply(X0,'least$uupper$ubound'(X1,X2)) = 'least$uupper$ubound'(multiply(X0,X1),multiply(X0,X2)),
    inference(clausification,[status(esa)],[monotony_lub1]) ).

cnf(d0,plain,
    multiply(X0,X1) = multiply(identity,multiply(X0,X1)),
    inference(superposition,[status(thm)],[c1,c3]) ).

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

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

cnf(d3,plain,
    multiply(identity,X1) = multiply(inverse(X0),multiply(X0,X1)),
    inference(superposition,[status(thm)],[c2,c3]) ).

cnf(d4,plain,
    X0 = multiply(inverse(X1),multiply(X1,X0)),
    inference(demodulation,[status(thm)],[d3,c1]) ).

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

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

cnf(d7,plain,
    multiply(X0,'least$uupper$ubound'(X1,inverse(X0))) = 'least$uupper$ubound'(multiply(X0,X1),identity),
    inference(superposition,[status(thm)],[d6,c12]) ).

cnf(d8,plain,
    multiply(X0,'least$uupper$ubound'(X1,inverse(X0))) = 'least$uupper$ubound'(identity,multiply(X0,X1)),
    inference(demodulation,[status(thm)],[d7,c5]) ).

cnf(d9,plain,
    'least$uupper$ubound'(identity,multiply(a,b)) != multiply(a,'least$uupper$ubound'(inverse(a),b)),
    inference(demodulation,[status(thm)],[c0,c5]) ).

cnf(d10,plain,
    'least$uupper$ubound'(identity,multiply(a,b)) != multiply(a,'least$uupper$ubound'(b,inverse(a))),
    inference(demodulation,[status(thm)],[d9,c5]) ).

cnf(d11,plain,
    'least$uupper$ubound'(identity,multiply(a,b)) != 'least$uupper$ubound'(identity,multiply(a,b)),
    inference(demodulation,[status(thm)],[d10,d8]) ).

cnf(d12,plain,
    'least$uupper$ubound'(X0,'greatest$ulower$ubound'(X1,X0)) = X0,
    inference(superposition,[status(thm)],[c4,c10]) ).

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

cnf(d14,plain,
    'greatest$ulower$ubound'(X2,'greatest$ulower$ubound'(X0,X1)) = 'greatest$ulower$ubound'(X0,'greatest$ulower$ubound'(X1,X2)),
    inference(superposition,[status(thm)],[c6,c4]) ).

cnf(d15,plain,
    'least$uupper$ubound'(X2,'greatest$ulower$ubound'(X2,'greatest$ulower$ubound'(X0,X1))) = X2,
    inference(superposition,[status(thm)],[d14,d13]) ).

cnf(d16,plain,
    X0 = X0,
    inference(demodulation,[status(thm)],[d15,c10]) ).

cnf(d17,plain,
    $false,
    inference(resolution,[status(thm)],[d16,d11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP186-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n011.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 14:37:00 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 102.25/36.08  % SZS status Unsatisfiable for theBenchmark.p
% 102.25/36.08  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------