↑ Up

FindProof---0.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : GRP186-4 : 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:38 PM UTC 2026

% Result   : Unsatisfiable 5.23s 1.16s
% Output   : CNFRefutation 5.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   20 (  20 unt;   0 nHn;  12 RR)
%            Number of literals    :   20 (  19 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;   4 con; 0-2 aty)
%            Number of variables   :   14 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(t18,axiom,
    sFlat0 = inverse(a),
    introduced(definition) ).

cnf(t123,plain,
    inverse(a) = sFlat0,
    inference(orient,[status(thm)],[t18]) ).

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

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

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

cnf(t44,plain,
    multiply(inverse(X1),X1) = identity,
    inference(orient,[status(thm)],[t5]) ).

cnf(t2,axiom,
    inverse(inverse(X1)) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(t28,plain,
    inverse(inverse(X1)) = X1,
    inference(orient,[status(thm)],[t2]) ).

cnf(t127,plain,
    a = inverse(sFlat0),
    inference(cp,[status(thm)],[t28,t123]) ).

cnf(t132,plain,
    inverse(sFlat0) = a,
    inference(orient,[status(thm)],[t127]) ).

cnf(t135,plain,
    identity = multiply(a,sFlat0),
    inference(cp,[status(thm)],[t44,t132]) ).

cnf(t151,plain,
    multiply(a,sFlat0) = identity,
    inference(orient,[status(thm)],[t135]) ).

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

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

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

cnf(g0_0,plain,
    multiply(a,least_upper_bound(inverse(a),b)) != multiply(a,least_upper_bound(sFlat0,b)),
    inference(rw,[status(thm)],[goal_0,t123]) ).

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP186-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.03  % 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.02/0.36  % CPULimit : 300
% 0.02/0.36  % WCLimit  : 300
% 0.02/0.36  % DateTime : Wed Sep 23 14:07:05 UTC 2026
% 0.02/0.36  % CPUTime  : 
% 0.02/0.36  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.23/1.16  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.23/1.16  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------