↑ Up

FindProof---0.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : GRP171-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 5.68s 11.52s
% Output   : CNFRefutation 5.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   34 (  34 unt;   0 nHn;  12 RR)
%            Number of literals    :   34 (  33 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    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   40 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
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(t11,axiom,
    least_upper_bound(least_upper_bound(X1,X2),X3) = least_upper_bound(X1,least_upper_bound(X2,X3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(t51,plain,
    least_upper_bound(least_upper_bound(X1,X2),X3) = least_upper_bound(X1,least_upper_bound(X2,X3)),
    inference(orient,[status(thm)],[t11]) ).

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

cnf(t64,plain,
    least_upper_bound(identity,b) = b,
    inference(orient,[status(thm)],[t3]) ).

cnf(t65,plain,
    least_upper_bound(identity,least_upper_bound(b,X1)) = least_upper_bound(b,X1),
    inference(cp,[status(thm)],[t51,t64]) ).

cnf(t112,plain,
    least_upper_bound(identity,least_upper_bound(b,X1)) = least_upper_bound(b,X1),
    inference(orient,[status(thm)],[t65]) ).

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

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

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

cnf(t26,plain,
    least_upper_bound(multiply(X1,X2),multiply(X3,X2)) = multiply(least_upper_bound(X1,X3),X2),
    inference(orient,[status(thm)],[t16]) ).

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

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

cnf(t27,plain,
    multiply(least_upper_bound(identity,X1),X2) = least_upper_bound(X2,multiply(X1,X2)),
    inference(cp,[status(thm)],[t26,t17]) ).

cnf(t279,plain,
    least_upper_bound(X1,multiply(X2,X1)) = multiply(least_upper_bound(identity,X2),X1),
    inference(orient,[status(thm)],[t27]) ).

cnf(t289,plain,
    identity = greatest_lower_bound(identity,multiply(least_upper_bound(identity,X1),b)),
    inference(cp,[status(thm)],[t115,t279]) ).

cnf(t566,plain,
    greatest_lower_bound(identity,multiply(least_upper_bound(identity,X1),b)) = identity,
    inference(orient,[status(thm)],[t289]) ).

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

cnf(t61,plain,
    least_upper_bound(identity,a) = a,
    inference(orient,[status(thm)],[t2]) ).

cnf(t572,plain,
    identity = greatest_lower_bound(identity,multiply(a,b)),
    inference(cp,[status(thm)],[t566,t61]) ).

cnf(t586,plain,
    greatest_lower_bound(identity,multiply(a,b)) = identity,
    inference(orient,[status(thm)],[t572]) ).

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

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

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

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

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

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

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

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

cnf(g0_1,plain,
    least_upper_bound(greatest_lower_bound(multiply(a,b),identity),multiply(a,b)) != multiply(a,b),
    inference(rw,[status(thm)],[g0_0,t67]) ).

cnf(g0_2,plain,
    least_upper_bound(multiply(a,b),greatest_lower_bound(multiply(a,b),identity)) != multiply(a,b),
    inference(rw,[status(thm)],[g0_1,t47]) ).

cnf(g0_3,plain,
    multiply(a,b) != multiply(a,b),
    inference(rw,[status(thm)],[g0_2,t19]) ).

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

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