↑ Up

FindProof---0.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : GRP524-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/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:27:27 PM UTC 2026

% Result   : Unsatisfiable 5.89s 1.17s
% Output   : CNFRefutation 5.89s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   29
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   49 (  49 unt;   0 nHn;   8 RR)
%            Number of literals    :   49 (  48 equ;   5 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    7 (   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   :   84 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(t4,axiom,
    sFlat1 = multiply(a,b),
    introduced(definition) ).

cnf(t23,plain,
    multiply(a,b) = sFlat1,
    inference(orient,[status(thm)],[t4]) ).

cnf(t2,axiom,
    divide(X1,divide(divide(X2,X2),X3)) = multiply(X1,X3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

cnf(t8,plain,
    divide(X1,divide(divide(X2,X2),X3)) = multiply(X1,X3),
    inference(orient,[status(thm)],[t2]) ).

cnf(t0,axiom,
    divide(divide(X1,X1),X2) = inverse(X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

cnf(t16,plain,
    divide(divide(X1,X1),X2) = inverse(X2),
    inference(orient,[status(thm)],[t0]) ).

cnf(t269,plain,
    divide(X1,inverse(X3)) = multiply(X1,X3),
    inference(step,[status(thm)],[t8,t16]) ).

cnf(t22,plain,
    divide(X1,inverse(X3)) = multiply(X1,X3),
    inference(rw,[status(thm)],[t269]) ).

cnf(t25,plain,
    divide(X1,inverse(X2)) = multiply(X1,X2),
    inference(orient,[status(thm)],[t22]) ).

cnf(t18,plain,
    inverse(X1) = divide(inverse(divide(X2,X2)),X1),
    inference(cp,[status(thm)],[t16,t16]) ).

cnf(t32,plain,
    divide(inverse(divide(X1,X1)),X2) = inverse(X2),
    inference(orient,[status(thm)],[t18]) ).

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

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

cnf(t33,plain,
    inverse(divide(X1,divide(X2,divide(inverse(divide(X3,X3)),X1)))) = X2,
    inference(cp,[status(thm)],[t32,t5]) ).

cnf(t270,plain,
    inverse(divide(X1,divide(X2,inverse(X1)))) = X2,
    inference(step,[status(thm)],[t33,t32]) ).

cnf(t271,plain,
    inverse(divide(X1,multiply(X2,X1))) = X2,
    inference(step,[status(thm)],[t270,t25]) ).

cnf(t43,plain,
    inverse(divide(X1,multiply(X2,X1))) = X2,
    inference(orient,[status(thm)],[t271]) ).

cnf(t45,plain,
    X1 = inverse(inverse(multiply(X1,divide(X2,X2)))),
    inference(cp,[status(thm)],[t43,t16]) ).

cnf(t78,plain,
    inverse(inverse(multiply(X1,divide(X2,X2)))) = X1,
    inference(orient,[status(thm)],[t45]) ).

cnf(t26,plain,
    multiply(divide(X1,X1),X2) = inverse(inverse(X2)),
    inference(cp,[status(thm)],[t25,t16]) ).

cnf(t29,plain,
    multiply(divide(X1,X1),X2) = inverse(inverse(X2)),
    inference(orient,[status(thm)],[t26]) ).

cnf(t46,plain,
    divide(X1,X1) = inverse(divide(X2,inverse(inverse(X2)))),
    inference(cp,[status(thm)],[t43,t29]) ).

cnf(t272,plain,
    divide(X1,X1) = inverse(multiply(X2,inverse(X2))),
    inference(step,[status(thm)],[t46,t25]) ).

cnf(t118,plain,
    divide(X1,X1) = inverse(multiply(X2,inverse(X2))),
    inference(orient,[status(thm)],[t272]) ).

cnf(t146,plain,
    divide(X1,X1) = divide(X2,X2),
    inference(cp,[status(thm)],[t118,t118]) ).

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

cnf(t148,plain,
    divide(X1,X1) = multiply(inverse(X2),X2),
    inference(cp,[status(thm)],[t147,t25]) ).

cnf(t158,plain,
    divide(X1,X1) = multiply(inverse(X2),X2),
    inference(orient,[status(thm)],[t148]) ).

cnf(t182,plain,
    inverse(X1) = inverse(divide(X1,divide(X2,X2))),
    inference(cp,[status(thm)],[t43,t158]) ).

cnf(t188,plain,
    inverse(divide(X1,divide(X2,X2))) = inverse(X1),
    inference(orient,[status(thm)],[t182]) ).

cnf(t198,plain,
    inverse(X1) = inverse(divide(X1,inverse(divide(X2,X2)))),
    inference(cp,[status(thm)],[t188,t16]) ).

cnf(t273,plain,
    inverse(X1) = inverse(multiply(X1,divide(X2,X2))),
    inference(step,[status(thm)],[t198,t25]) ).

cnf(t204,plain,
    inverse(multiply(X1,divide(X2,X2))) = inverse(X1),
    inference(orient,[status(thm)],[t273]) ).

cnf(t274,plain,
    inverse(inverse(X1)) = X1,
    inference(step,[status(thm)],[t78,t204]) ).

cnf(t217,plain,
    inverse(inverse(X1)) = X1,
    inference(rw,[status(thm)],[t274]) ).

cnf(t218,plain,
    inverse(inverse(X1)) = X1,
    inference(orient,[status(thm)],[t217]) ).

cnf(t229,plain,
    multiply(X1,inverse(X2)) = divide(X1,X2),
    inference(cp,[status(thm)],[t25,t218]) ).

cnf(t238,plain,
    multiply(X1,inverse(X2)) = divide(X1,X2),
    inference(orient,[status(thm)],[t229]) ).

cnf(t226,plain,
    divide(X1,divide(X2,X2)) = inverse(inverse(X1)),
    inference(cp,[status(thm)],[t218,t188]) ).

cnf(t283,plain,
    divide(X1,divide(X2,X2)) = X1,
    inference(step,[status(thm)],[t226,t218]) ).

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

cnf(t259,plain,
    X1 = divide(X2,divide(X2,X1)),
    inference(cp,[status(thm)],[t5,t252]) ).

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

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

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

cnf(g0_1,plain,
    sFlat1 != multiply(b,inverse(divide(b,sFlat1))),
    inference(rw,[status(thm)],[g0_0]) ).

cnf(g0_2,plain,
    sFlat1 != divide(b,divide(b,sFlat1)),
    inference(rw,[status(thm)],[g0_1,t238]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP524-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.08/0.36  % Computer : n002.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 : Wed Sep 23 15:01:21 UTC 2026
% 0.08/0.37  % CPUTime  : 
% 0.08/0.37  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.89/1.17  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.89/1.17  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------