↑ Up

FindProof---0.1.UNS-CRf.s

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

% Computer : n014.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:29 PM UTC 2026

% Result   : Unsatisfiable 4.69s 6.14s
% Output   : CNFRefutation 4.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   28 (  28 unt;   0 nHn;   4 RR)
%            Number of literals    :   28 (  27 equ;   3 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   :   39 (   0 sgn)

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

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

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

cnf(t72,plain,
    divide(X1,divide(identity,X3)) = multiply(X1,X3),
    inference(step,[status(thm)],[t2,t8]) ).

cnf(t12,plain,
    divide(X1,divide(identity,X2)) = multiply(X1,X2),
    inference(orient,[status(thm)],[t72]) ).

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

cnf(t73,plain,
    divide(identity,X2) = inverse(X2),
    inference(step,[status(thm)],[t1,t8]) ).

cnf(t19,plain,
    divide(identity,X1) = inverse(X1),
    inference(orient,[status(thm)],[t73]) ).

cnf(t74,plain,
    divide(X1,inverse(X2)) = multiply(X1,X2),
    inference(step,[status(thm)],[t12,t19]) ).

cnf(t23,plain,
    divide(X1,inverse(X2)) = multiply(X1,X2),
    inference(rw,[status(thm)],[t74]) ).

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

cnf(t26,plain,
    multiply(inverse(X1),X1) = identity,
    inference(cp,[status(thm)],[t25,t8]) ).

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

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

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

cnf(t9,plain,
    X1 = divide(identity,divide(divide(X2,X1),X2)),
    inference(cp,[status(thm)],[t4,t8]) ).

cnf(t76,plain,
    X1 = inverse(divide(divide(X2,X1),X2)),
    inference(step,[status(thm)],[t9,t19]) ).

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

cnf(t57,plain,
    X1 = inverse(divide(identity,X1)),
    inference(cp,[status(thm)],[t53,t8]) ).

cnf(t77,plain,
    X1 = inverse(inverse(X1)),
    inference(step,[status(thm)],[t57,t19]) ).

cnf(t27,plain,
    multiply(identity,X1) = inverse(inverse(X1)),
    inference(cp,[status(thm)],[t25,t19]) ).

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

cnf(t78,plain,
    X1 = multiply(identity,X1),
    inference(step,[status(thm)],[t77,t32]) ).

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

cnf(goal_0,negated_conjecture,
    multiply(multiply(inverse(b2),b2),a2) != a2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(g0_0,plain,
    multiply(identity,a2) != a2,
    inference(rw,[status(thm)],[goal_0,t41]) ).

cnf(g0_1,plain,
    a2 != a2,
    inference(rw,[status(thm)],[g0_0,t67]) ).

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

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