↑ Up

FindProof---0.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : GRP172-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n002.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 : Fri Sep 25 01:25:31 PM UTC 2026

% Result   : Unsatisfiable 6.09s 1.28s
% Output   : CNFRefutation 6.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   56 (  56 unt;   0 nHn;  33 RR)
%            Number of literals    :   56 (  55 equ;   6 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   43 (   9 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(t10,axiom,
    greatest_lower_bound(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(X1,greatest_lower_bound(X2,X3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(t63,plain,
    greatest_lower_bound(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(X1,greatest_lower_bound(X2,X3)),
    inference(orient,[status(thm)],[t10]) ).

cnf(t2,axiom,
    greatest_lower_bound(identity,b) = identity,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(t78,plain,
    greatest_lower_bound(identity,b) = identity,
    inference(orient,[status(thm)],[t2]) ).

cnf(t79,plain,
    greatest_lower_bound(identity,greatest_lower_bound(b,X1)) = greatest_lower_bound(identity,X1),
    inference(cp,[status(thm)],[t63,t78]) ).

cnf(t195,plain,
    greatest_lower_bound(identity,greatest_lower_bound(b,X1)) = greatest_lower_bound(identity,X1),
    inference(orient,[status(thm)],[t79]) ).

cnf(t7,axiom,
    greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(t21,plain,
    greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
    inference(orient,[status(thm)],[t7]) ).

cnf(t8,axiom,
    least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(t80,plain,
    least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
    inference(orient,[status(thm)],[t8]) ).

cnf(t83,plain,
    X1 = greatest_lower_bound(X1,least_upper_bound(X2,X1)),
    inference(cp,[status(thm)],[t21,t80]) ).

cnf(t114,plain,
    greatest_lower_bound(X1,least_upper_bound(X2,X1)) = X1,
    inference(orient,[status(thm)],[t83]) ).

cnf(t197,plain,
    greatest_lower_bound(identity,least_upper_bound(X1,b)) = greatest_lower_bound(identity,b),
    inference(cp,[status(thm)],[t195,t114]) ).

cnf(t284,plain,
    greatest_lower_bound(identity,least_upper_bound(X1,b)) = identity,
    inference(step,[status(thm)],[t197,t78]) ).

cnf(t206,plain,
    greatest_lower_bound(identity,least_upper_bound(X1,b)) = identity,
    inference(orient,[status(thm)],[t284]) ).

cnf(t9,axiom,
    least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(t23,plain,
    least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
    inference(orient,[status(thm)],[t9]) ).

cnf(t14,axiom,
    greatest_lower_bound(multiply(X1,X2),multiply(X3,X2)) = multiply(greatest_lower_bound(X1,X3),X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(t28,plain,
    greatest_lower_bound(multiply(X1,X2),multiply(X3,X2)) = multiply(greatest_lower_bound(X1,X3),X2),
    inference(orient,[status(thm)],[t14]) ).

cnf(t4,axiom,
    multiply(identity,X1) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(t19,plain,
    multiply(identity,X1) = X1,
    inference(orient,[status(thm)],[t4]) ).

cnf(t29,plain,
    multiply(greatest_lower_bound(identity,X1),X2) = greatest_lower_bound(X2,multiply(X1,X2)),
    inference(cp,[status(thm)],[t28,t19]) ).

cnf(t237,plain,
    greatest_lower_bound(X1,multiply(X2,X1)) = multiply(greatest_lower_bound(identity,X2),X1),
    inference(orient,[status(thm)],[t29]) ).

cnf(t17,axiom,
    sFlat0 = multiply(a,b),
    introduced(definition) ).

cnf(t39,plain,
    multiply(a,b) = sFlat0,
    inference(orient,[status(thm)],[t17]) ).

cnf(t241,plain,
    multiply(greatest_lower_bound(identity,a),b) = greatest_lower_bound(b,sFlat0),
    inference(cp,[status(thm)],[t237,t39]) ).

cnf(t1,axiom,
    greatest_lower_bound(identity,a) = identity,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(t76,plain,
    greatest_lower_bound(identity,a) = identity,
    inference(orient,[status(thm)],[t1]) ).

cnf(t288,plain,
    multiply(identity,b) = greatest_lower_bound(b,sFlat0),
    inference(step,[status(thm)],[t241,t76]) ).

cnf(t289,plain,
    b = greatest_lower_bound(b,sFlat0),
    inference(step,[status(thm)],[t288,t19]) ).

cnf(t6,axiom,
    greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(t59,plain,
    greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
    inference(orient,[status(thm)],[t6]) ).

cnf(t290,plain,
    b = greatest_lower_bound(sFlat0,b),
    inference(step,[status(thm)],[t289,t59]) ).

cnf(t250,plain,
    greatest_lower_bound(sFlat0,b) = b,
    inference(orient,[status(thm)],[t290]) ).

cnf(t252,plain,
    sFlat0 = least_upper_bound(sFlat0,b),
    inference(cp,[status(thm)],[t23,t250]) ).

cnf(t253,plain,
    least_upper_bound(sFlat0,b) = sFlat0,
    inference(orient,[status(thm)],[t252]) ).

cnf(t255,plain,
    identity = greatest_lower_bound(identity,sFlat0),
    inference(cp,[status(thm)],[t206,t253]) ).

cnf(t291,plain,
    identity = greatest_lower_bound(sFlat0,identity),
    inference(step,[status(thm)],[t255,t59]) ).

cnf(t18,axiom,
    sFlat1 = greatest_lower_bound(identity,multiply(a,b)),
    introduced(definition) ).

cnf(t267,plain,
    sFlat1 = greatest_lower_bound(identity,sFlat0),
    inference(step,[status(thm)],[t18,t39]) ).

cnf(t268,plain,
    sFlat1 = greatest_lower_bound(sFlat0,identity),
    inference(step,[status(thm)],[t267,t59]) ).

cnf(t73,plain,
    greatest_lower_bound(sFlat0,identity) = sFlat1,
    inference(orient,[status(thm)],[t268]) ).

cnf(t292,plain,
    identity = sFlat1,
    inference(step,[status(thm)],[t291,t73]) ).

cnf(t258,plain,
    identity = sFlat1,
    inference(orient,[status(thm)],[t292]) ).

cnf(t75,plain,
    sFlat0 = least_upper_bound(sFlat0,sFlat1),
    inference(cp,[status(thm)],[t23,t73]) ).

cnf(t94,plain,
    least_upper_bound(sFlat0,sFlat1) = sFlat0,
    inference(orient,[status(thm)],[t75]) ).

cnf(t117,plain,
    sFlat1 = greatest_lower_bound(sFlat1,sFlat0),
    inference(cp,[status(thm)],[t114,t94]) ).

cnf(t272,plain,
    sFlat1 = greatest_lower_bound(sFlat0,sFlat1),
    inference(step,[status(thm)],[t117,t59]) ).

cnf(t120,plain,
    greatest_lower_bound(sFlat0,sFlat1) = sFlat1,
    inference(orient,[status(thm)],[t272]) ).

cnf(goal_0,negated_conjecture,
    greatest_lower_bound(identity,multiply(a,b)) != identity,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(g0_0,plain,
    greatest_lower_bound(sFlat1,multiply(a,b)) != identity,
    inference(rw,[status(thm)],[goal_0,t258]) ).

cnf(g0_1,plain,
    greatest_lower_bound(sFlat1,sFlat0) != identity,
    inference(rw,[status(thm)],[g0_0,t39]) ).

cnf(g0_2,plain,
    greatest_lower_bound(sFlat0,sFlat1) != identity,
    inference(rw,[status(thm)],[g0_1,t59]) ).

cnf(g0_3,plain,
    sFlat1 != identity,
    inference(rw,[status(thm)],[g0_2,t120]) ).

cnf(g0_4,plain,
    sFlat1 != sFlat1,
    inference(rw,[status(thm)],[g0_3,t258]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP172-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.36  % Computer : n002.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Wed Sep 23 14:00:36 UTC 2026
% 0.12/0.36  % CPUTime  : 
% 0.12/0.36  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.09/1.28  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.09/1.28  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------