↑ Up

LisaST---0.9.UNS-CRf.s

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

% Computer : n007.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:13 AM UTC 2026

% Result   : Unsatisfiable 8.97s 8.09s
% Output   : CNFRefutation 8.97s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   39 (  39 unt;   0 nHn;  22 RR)
%            Number of literals    :   39 (  38 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   1 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   :   34 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(ax_glb1a_1,hypothesis,
    'least$uupper$ubound'(a,c) = a ).

cnf(ax_glb1a_2,hypothesis,
    'least$uupper$ubound'(b,c) = b ).

cnf(prove_ax_glb1a,negated_conjecture,
    'least$uupper$ubound'('greatest$ulower$ubound'(a,b),c) != 'greatest$ulower$ubound'(a,b) ).

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(idempotence_of_gld,axiom,
    'greatest$ulower$ubound'(X0,X0) = X0 ).

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

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

cnf(c0,plain,
    'least$uupper$ubound'(a,c) = a,
    inference(clausification,[status(esa)],[ax_glb1a_1]) ).

cnf(c1,plain,
    'least$uupper$ubound'(b,c) = b,
    inference(clausification,[status(esa)],[ax_glb1a_2]) ).

cnf(c2,plain,
    'least$uupper$ubound'('greatest$ulower$ubound'(a,b),c) != 'greatest$ulower$ubound'(a,b),
    inference(clausification,[status(esa)],[prove_ax_glb1a]) ).

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

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

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(c11,plain,
    'greatest$ulower$ubound'(X0,X0) = X0,
    inference(clausification,[status(esa)],[idempotence_of_gld]) ).

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

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

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

cnf(d1,plain,
    'greatest$ulower$ubound'(X0,'least$uupper$ubound'(X1,X0)) = X0,
    inference(superposition,[status(thm)],[c7,c13]) ).

cnf(d2,plain,
    'greatest$ulower$ubound'('greatest$ulower$ubound'(X0,X1),X0) = 'greatest$ulower$ubound'(X0,X1),
    inference(superposition,[status(thm)],[c12,d1]) ).

cnf(d3,plain,
    'greatest$ulower$ubound'(X0,'greatest$ulower$ubound'(X1,X0)) = 'greatest$ulower$ubound'(X0,X1),
    inference(demodulation,[status(thm)],[d2,c8]) ).

cnf(d4,plain,
    'greatest$ulower$ubound'(c,a) = c,
    inference(superposition,[status(thm)],[c0,d1]) ).

cnf(d5,plain,
    'greatest$ulower$ubound'(a,c) = c,
    inference(demodulation,[status(thm)],[d4,c6]) ).

cnf(d6,plain,
    'greatest$ulower$ubound'(c,c) = 'greatest$ulower$ubound'(c,a),
    inference(superposition,[status(thm)],[d5,d3]) ).

cnf(d7,plain,
    c = 'greatest$ulower$ubound'(c,a),
    inference(demodulation,[status(thm)],[d6,c11]) ).

cnf(d8,plain,
    c = 'greatest$ulower$ubound'(a,c),
    inference(demodulation,[status(thm)],[d7,c6]) ).

cnf(d9,plain,
    'least$uupper$ubound'('greatest$ulower$ubound'(X0,a),'greatest$ulower$ubound'(X0,c)) = 'greatest$ulower$ubound'(X0,a),
    inference(superposition,[status(thm)],[d8,d0]) ).

cnf(d10,plain,
    'greatest$ulower$ubound'(c,b) = c,
    inference(superposition,[status(thm)],[c1,d1]) ).

cnf(d11,plain,
    'greatest$ulower$ubound'(b,c) = c,
    inference(demodulation,[status(thm)],[d10,c6]) ).

cnf(d12,plain,
    'greatest$ulower$ubound'(c,c) = 'greatest$ulower$ubound'(c,b),
    inference(superposition,[status(thm)],[d11,d3]) ).

cnf(d13,plain,
    c = 'greatest$ulower$ubound'(c,b),
    inference(demodulation,[status(thm)],[d12,c11]) ).

cnf(d14,plain,
    c = 'greatest$ulower$ubound'(b,c),
    inference(demodulation,[status(thm)],[d13,c6]) ).

cnf(d15,plain,
    'least$uupper$ubound'('greatest$ulower$ubound'(b,a),c) = 'greatest$ulower$ubound'(b,a),
    inference(superposition,[status(thm)],[d14,d9]) ).

cnf(d16,plain,
    'least$uupper$ubound'(c,'greatest$ulower$ubound'(b,a)) = 'greatest$ulower$ubound'(b,a),
    inference(demodulation,[status(thm)],[d15,c7]) ).

cnf(d17,plain,
    'least$uupper$ubound'(c,'greatest$ulower$ubound'(a,b)) = 'greatest$ulower$ubound'(b,a),
    inference(demodulation,[status(thm)],[d16,c6]) ).

cnf(d18,plain,
    'least$uupper$ubound'(c,'greatest$ulower$ubound'(a,b)) = 'greatest$ulower$ubound'(a,b),
    inference(demodulation,[status(thm)],[d17,c6]) ).

cnf(d19,plain,
    'least$uupper$ubound'(c,'greatest$ulower$ubound'(a,b)) != 'greatest$ulower$ubound'(a,b),
    inference(demodulation,[status(thm)],[c2,c7]) ).

cnf(d20,plain,
    $false,
    inference(resolution,[status(thm)],[d19,d18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP138-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04  % Command  : casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36  % Computer : n007.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Fri Sep 25 14:29:38 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running casc-portfolio.sh -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.97/8.09  % SZS status Unsatisfiable for theBenchmark.p
% 8.97/8.09  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
%------------------------------------------------------------------------------