↑ Up

FindProof---0.1.UNS-CRf.s

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

% 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 : Fri Sep 25 01:27:30 PM UTC 2026

% Result   : Unsatisfiable 3.67s 1.04s
% Output   : CNFRefutation 3.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   52 (  52 unt;   0 nHn;  33 RR)
%            Number of literals    :   52 (  51 equ;   6 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   34 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(t2,axiom,
    sF0 = divide(identity,a),
    introduced(definition) ).

cnf(t7,plain,
    divide(identity,a) = sF0,
    inference(orient,[status(thm)],[t2]) ).

cnf(t3,axiom,
    sF1 = divide(b,divide(identity,a)),
    introduced(definition) ).

cnf(t138,plain,
    sF1 = divide(b,sF0),
    inference(step,[status(thm)],[t3,t7]) ).

cnf(t9,plain,
    divide(b,sF0) = sF1,
    inference(orient,[status(thm)],[t138]) ).

cnf(t4,axiom,
    sF2 = divide(identity,b),
    introduced(definition) ).

cnf(t8,plain,
    divide(identity,b) = sF2,
    inference(orient,[status(thm)],[t4]) ).

cnf(t5,axiom,
    sF3 = divide(a,divide(identity,b)),
    introduced(definition) ).

cnf(t139,plain,
    sF3 = divide(a,sF2),
    inference(step,[status(thm)],[t5,t8]) ).

cnf(t10,plain,
    divide(a,sF2) = sF3,
    inference(orient,[status(thm)],[t139]) ).

cnf(t1,axiom,
    divide(divide(identity,divide(X1,X2)),divide(divide(X2,X3),X1)) = X3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(t11,plain,
    divide(divide(identity,divide(X1,X2)),divide(divide(X2,X3),X1)) = X3,
    inference(orient,[status(thm)],[t1]) ).

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

cnf(t6,plain,
    divide(X1,X1) = identity,
    inference(orient,[status(thm)],[t0]) ).

cnf(t13,plain,
    X1 = divide(divide(identity,divide(divide(X2,X1),X2)),identity),
    inference(cp,[status(thm)],[t11,t6]) ).

cnf(t12,plain,
    X1 = divide(divide(identity,identity),divide(divide(X2,X1),X2)),
    inference(cp,[status(thm)],[t11,t6]) ).

cnf(t140,plain,
    X1 = divide(identity,divide(divide(X2,X1),X2)),
    inference(step,[status(thm)],[t12,t6]) ).

cnf(t26,plain,
    divide(identity,divide(divide(X1,X2),X1)) = X2,
    inference(orient,[status(thm)],[t140]) ).

cnf(t141,plain,
    X1 = divide(X1,identity),
    inference(step,[status(thm)],[t13,t26]) ).

cnf(t50,plain,
    divide(X1,identity) = X1,
    inference(orient,[status(thm)],[t141]) ).

cnf(t52,plain,
    X1 = divide(divide(identity,divide(identity,X2)),divide(X2,X1)),
    inference(cp,[status(thm)],[t11,t50]) ).

cnf(t27,plain,
    X1 = divide(identity,divide(identity,X1)),
    inference(cp,[status(thm)],[t26,t6]) ).

cnf(t37,plain,
    divide(identity,divide(identity,X1)) = X1,
    inference(orient,[status(thm)],[t27]) ).

cnf(t149,plain,
    X1 = divide(X2,divide(X2,X1)),
    inference(step,[status(thm)],[t52,t37]) ).

cnf(t114,plain,
    divide(X1,divide(X1,X2)) = X2,
    inference(orient,[status(thm)],[t149]) ).

cnf(t33,plain,
    divide(divide(X1,X2),X1) = divide(identity,divide(X2,identity)),
    inference(cp,[status(thm)],[t26,t26]) ).

cnf(t146,plain,
    divide(divide(X1,X2),X1) = divide(identity,X2),
    inference(step,[status(thm)],[t33,t50]) ).

cnf(t74,plain,
    divide(divide(X1,X2),X1) = divide(identity,X2),
    inference(orient,[status(thm)],[t146]) ).

cnf(t30,plain,
    sF0 = divide(identity,divide(sF1,b)),
    inference(cp,[status(thm)],[t26,t9]) ).

cnf(t54,plain,
    divide(identity,divide(sF1,b)) = sF0,
    inference(orient,[status(thm)],[t30]) ).

cnf(t58,plain,
    divide(sF1,b) = divide(identity,divide(sF0,identity)),
    inference(cp,[status(thm)],[t26,t54]) ).

cnf(t142,plain,
    divide(sF1,b) = divide(identity,sF0),
    inference(step,[status(thm)],[t58,t50]) ).

cnf(t38,plain,
    a = divide(identity,sF0),
    inference(cp,[status(thm)],[t37,t7]) ).

cnf(t44,plain,
    divide(identity,sF0) = a,
    inference(orient,[status(thm)],[t38]) ).

cnf(t143,plain,
    divide(sF1,b) = a,
    inference(step,[status(thm)],[t142,t44]) ).

cnf(t59,plain,
    divide(sF1,b) = a,
    inference(orient,[status(thm)],[t143]) ).

cnf(t77,plain,
    divide(identity,b) = divide(a,sF1),
    inference(cp,[status(thm)],[t74,t59]) ).

cnf(t147,plain,
    sF2 = divide(a,sF1),
    inference(step,[status(thm)],[t77,t8]) ).

cnf(t82,plain,
    divide(a,sF1) = sF2,
    inference(orient,[status(thm)],[t147]) ).

cnf(t122,plain,
    sF1 = divide(a,sF2),
    inference(cp,[status(thm)],[t114,t82]) ).

cnf(t151,plain,
    sF1 = sF3,
    inference(step,[status(thm)],[t122,t10]) ).

cnf(t132,plain,
    sF3 = sF1,
    inference(orient,[status(thm)],[t151]) ).

cnf(t152,plain,
    divide(a,sF2) = sF1,
    inference(step,[status(thm)],[t10,t132]) ).

cnf(t133,plain,
    divide(a,sF2) = sF1,
    inference(orient,[status(thm)],[t152]) ).

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

cnf(d0,axiom,
    multiply(A,B) = divide(A,divide(identity,B)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(goal_0,negated_conjecture,
    divide(b,divide(identity,a)) != divide(a,divide(identity,b)),
    inference(definition_unfolding,[status(thm)],[u0,d0]) ).

cnf(g0_0,plain,
    divide(b,sF0) != divide(a,divide(identity,b)),
    inference(rw,[status(thm)],[goal_0,t7]) ).

cnf(g0_1,plain,
    sF1 != divide(a,divide(identity,b)),
    inference(rw,[status(thm)],[g0_0,t9]) ).

cnf(g0_2,plain,
    sF1 != divide(a,sF2),
    inference(rw,[status(thm)],[g0_1,t8]) ).

cnf(g0_3,plain,
    sF1 != sF1,
    inference(rw,[status(thm)],[g0_2,t133]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP548-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.37  % Computer : n007.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Wed Sep 23 15:00:52 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.67/1.04  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.67/1.04  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------