↑ Up

FindProof---0.1.UNS-CRf.s

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

% Computer : n003.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:24:52 PM UTC 2026

% Result   : Unsatisfiable 4.22s 1.14s
% Output   : CNFRefutation 4.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   29 (  29 unt;   0 nHn;  16 RR)
%            Number of literals    :   29 (  28 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   20 (   0 sgn)

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

cnf(t18,plain,
    multiply(b,a) = sFlat0,
    inference(orient,[status(thm)],[t7]) ).

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

cnf(t11,plain,
    multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
    inference(orient,[status(thm)],[t6]) ).

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

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

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

cnf(t3,axiom,
    multiply(identity,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

cnf(t51,plain,
    multiply(X1,multiply(X1,X2)) = X2,
    inference(step,[status(thm)],[t13,t9]) ).

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

cnf(t19,plain,
    multiply(b,multiply(a,X1)) = multiply(sFlat0,X1),
    inference(cp,[status(thm)],[t11,t18]) ).

cnf(t38,plain,
    multiply(b,multiply(a,X1)) = multiply(sFlat0,X1),
    inference(orient,[status(thm)],[t19]) ).

cnf(t2,axiom,
    multiply(a,b) = c,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

cnf(t20,plain,
    multiply(a,b) = c,
    inference(orient,[status(thm)],[t2]) ).

cnf(t30,plain,
    b = multiply(a,c),
    inference(cp,[status(thm)],[t26,t20]) ).

cnf(t34,plain,
    multiply(a,c) = b,
    inference(orient,[status(thm)],[t30]) ).

cnf(t40,plain,
    multiply(sFlat0,c) = multiply(b,b),
    inference(cp,[status(thm)],[t38,t34]) ).

cnf(t53,plain,
    multiply(sFlat0,c) = identity,
    inference(step,[status(thm)],[t40,t10]) ).

cnf(t44,plain,
    multiply(sFlat0,c) = identity,
    inference(orient,[status(thm)],[t53]) ).

cnf(t46,plain,
    c = multiply(sFlat0,identity),
    inference(cp,[status(thm)],[t26,t44]) ).

cnf(t1,axiom,
    multiply(X1,identity) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

cnf(t54,plain,
    c = sFlat0,
    inference(step,[status(thm)],[t46,t8]) ).

cnf(t47,plain,
    c = sFlat0,
    inference(orient,[status(thm)],[t54]) ).

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

cnf(g0_0,plain,
    sFlat0 != c,
    inference(rw,[status(thm)],[goal_0,t18]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP001-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.40  % Computer : n003.cluster.edu
% 0.09/0.40  % Model    : x86_64 x86_64
% 0.09/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.40  % Memory   : 8046.5625MB
% 0.09/0.40  % OS       : Linux 6.8.0-71-generic
% 0.09/0.40  % CPULimit : 300
% 0.09/0.40  % WCLimit  : 300
% 0.09/0.40  % DateTime : Wed Sep 23 13:12:05 UTC 2026
% 0.09/0.40  % CPUTime  : 
% 0.09/0.40  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.22/1.14  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.22/1.14  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------