↑ Up

FindProof---0.1.UNS-CRf.s

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

% Computer : n015.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:31 PM UTC 2026

% Result   : Unsatisfiable 5.07s 1.09s
% Output   : CNFRefutation 5.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   46 (  46 unt;   0 nHn;  27 RR)
%            Number of literals    :   46 (  45 equ;   8 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   36 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(t1,axiom,
    sF0 = inverse(b1),
    introduced(definition) ).

cnf(t5,plain,
    inverse(b1) = sF0,
    inference(orient,[status(thm)],[t1]) ).

cnf(t2,axiom,
    sF1 = divide(inverse(b1),inverse(b1)),
    introduced(definition) ).

cnf(t311,plain,
    sF1 = divide(sF0,inverse(b1)),
    inference(step,[status(thm)],[t2,t5]) ).

cnf(t312,plain,
    sF1 = divide(sF0,sF0),
    inference(step,[status(thm)],[t311,t5]) ).

cnf(t7,plain,
    divide(sF0,sF0) = sF1,
    inference(orient,[status(thm)],[t312]) ).

cnf(t3,axiom,
    sF2 = inverse(a1),
    introduced(definition) ).

cnf(t6,plain,
    inverse(a1) = sF2,
    inference(orient,[status(thm)],[t3]) ).

cnf(t4,axiom,
    sF3 = divide(inverse(a1),inverse(a1)),
    introduced(definition) ).

cnf(t313,plain,
    sF3 = divide(sF2,inverse(a1)),
    inference(step,[status(thm)],[t4,t6]) ).

cnf(t314,plain,
    sF3 = divide(sF2,sF2),
    inference(step,[status(thm)],[t313,t6]) ).

cnf(t8,plain,
    divide(sF2,sF2) = sF3,
    inference(orient,[status(thm)],[t314]) ).

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

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

cnf(t14,plain,
    X1 = divide(X2,inverse(divide(X3,divide(X2,inverse(divide(divide(X3,Y3),divide(X1,Y3))))))),
    inference(cp,[status(thm)],[t9,t9]) ).

cnf(t68,plain,
    divide(X1,inverse(divide(X2,divide(X1,inverse(divide(divide(X2,X3),divide(Y3,X3))))))) = Y3,
    inference(orient,[status(thm)],[t14]) ).

cnf(t69,plain,
    X1 = divide(X1,inverse(divide(X2,X2))),
    inference(cp,[status(thm)],[t68,t9]) ).

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

cnf(t109,plain,
    X1 = divide(X2,inverse(divide(X1,divide(X2,inverse(divide(X3,X3)))))),
    inference(cp,[status(thm)],[t9,t99]) ).

cnf(t329,plain,
    X1 = divide(X2,inverse(divide(X1,X2))),
    inference(step,[status(thm)],[t109,t99]) ).

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

cnf(t106,plain,
    X1 = divide(X1,inverse(sF1)),
    inference(cp,[status(thm)],[t99,t7]) ).

cnf(t111,plain,
    divide(X1,inverse(sF1)) = X1,
    inference(orient,[status(thm)],[t106]) ).

cnf(t231,plain,
    X1 = divide(inverse(sF1),inverse(X1)),
    inference(cp,[status(thm)],[t219,t111]) ).

cnf(t254,plain,
    divide(inverse(sF1),inverse(X1)) = X1,
    inference(orient,[status(thm)],[t231]) ).

cnf(t264,plain,
    sF1 = inverse(sF1),
    inference(cp,[status(thm)],[t254,t111]) ).

cnf(t276,plain,
    inverse(sF1) = sF1,
    inference(orient,[status(thm)],[t264]) ).

cnf(t339,plain,
    divide(sF1,inverse(X1)) = X1,
    inference(step,[status(thm)],[t254,t276]) ).

cnf(t279,plain,
    divide(sF1,inverse(X1)) = X1,
    inference(rw,[status(thm)],[t339]) ).

cnf(t283,plain,
    divide(sF1,inverse(X1)) = X1,
    inference(orient,[status(thm)],[t279]) ).

cnf(t107,plain,
    X1 = divide(X1,inverse(sF3)),
    inference(cp,[status(thm)],[t99,t8]) ).

cnf(t116,plain,
    divide(X1,inverse(sF3)) = X1,
    inference(orient,[status(thm)],[t107]) ).

cnf(t291,plain,
    sF3 = sF1,
    inference(cp,[status(thm)],[t283,t116]) ).

cnf(t302,plain,
    sF3 = sF1,
    inference(orient,[status(thm)],[t291]) ).

cnf(t340,plain,
    divide(sF2,sF2) = sF1,
    inference(step,[status(thm)],[t8,t302]) ).

cnf(t303,plain,
    divide(sF2,sF2) = sF1,
    inference(orient,[status(thm)],[t340]) ).

cnf(u0,negated_conjecture,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

cnf(goal_0,negated_conjecture,
    divide(inverse(b1),inverse(b1)) != divide(inverse(a1),inverse(a1)),
    inference(definition_unfolding,[status(thm)],[u0,d0]) ).

cnf(g0_0,plain,
    divide(sF0,inverse(b1)) != divide(inverse(a1),inverse(a1)),
    inference(rw,[status(thm)],[goal_0,t5]) ).

cnf(g0_1,plain,
    divide(sF0,sF0) != divide(inverse(a1),inverse(a1)),
    inference(rw,[status(thm)],[g0_0,t5]) ).

cnf(g0_2,plain,
    sF1 != divide(inverse(a1),inverse(a1)),
    inference(rw,[status(thm)],[g0_1,t7]) ).

cnf(g0_3,plain,
    sF1 != divide(sF2,inverse(a1)),
    inference(rw,[status(thm)],[g0_2,t6]) ).

cnf(g0_4,plain,
    sF1 != divide(sF2,sF2),
    inference(rw,[status(thm)],[g0_3,t6]) ).

cnf(g0_5,plain,
    sF1 != sF1,
    inference(rw,[status(thm)],[g0_4,t303]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP557-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.37  % Computer : n015.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Wed Sep 23 15:07:25 UTC 2026
% 0.09/0.38  % CPUTime  : 
% 0.09/0.38  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.07/1.09  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.07/1.09  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------