↑ Up

FindProof---0.1.UNS-CRf.s

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

% Computer : n018.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:58 PM UTC 2026

% Result   : Unsatisfiable 5.82s 1.53s
% Output   : CNFRefutation 5.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   26 (  26 unt;   0 nHn;   4 RR)
%            Number of literals    :   26 (  25 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   :   42 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(t4,axiom,
    mult(op_c,X1) = mult(X1,op_c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

cnf(t35,plain,
    mult(X1,op_c) = mult(op_c,X1),
    inference(orient,[status(thm)],[t4]) ).

cnf(t7,axiom,
    mult(mult(X1,X2),ld(X2,mult(X3,X2))) = mult(mult(X1,X3),X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

cnf(t45,plain,
    mult(mult(X1,X2),ld(X2,mult(X3,X2))) = mult(mult(X1,X3),X2),
    inference(orient,[status(thm)],[t7]) ).

cnf(t5,axiom,
    mult(rd(X1,X2),X2) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

cnf(t11,plain,
    mult(rd(X1,X2),X2) = X1,
    inference(orient,[status(thm)],[t5]) ).

cnf(t48,plain,
    mult(mult(rd(X1,X2),X3),X2) = mult(X1,ld(X2,mult(X3,X2))),
    inference(cp,[status(thm)],[t45,t11]) ).

cnf(t111,plain,
    mult(mult(rd(X1,X2),X3),X2) = mult(X1,ld(X2,mult(X3,X2))),
    inference(orient,[status(thm)],[t48]) ).

cnf(t113,plain,
    mult(X1,ld(op_c,mult(X2,op_c))) = mult(op_c,mult(rd(X1,op_c),X2)),
    inference(cp,[status(thm)],[t111,t35]) ).

cnf(t2,axiom,
    ld(X1,mult(X1,X2)) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

cnf(t19,plain,
    ld(X1,mult(X1,X2)) = X2,
    inference(orient,[status(thm)],[t2]) ).

cnf(t36,plain,
    mult(op_c,rd(X1,op_c)) = X1,
    inference(cp,[status(thm)],[t35,t11]) ).

cnf(t71,plain,
    mult(op_c,rd(X1,op_c)) = X1,
    inference(orient,[status(thm)],[t36]) ).

cnf(t73,plain,
    rd(X1,op_c) = ld(op_c,X1),
    inference(cp,[status(thm)],[t19,t71]) ).

cnf(t79,plain,
    ld(op_c,X1) = rd(X1,op_c),
    inference(orient,[status(thm)],[t73]) ).

cnf(t155,plain,
    mult(X1,rd(mult(X2,op_c),op_c)) = mult(op_c,mult(rd(X1,op_c),X2)),
    inference(step,[status(thm)],[t113,t79]) ).

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

cnf(t15,plain,
    rd(mult(X1,X2),X2) = X1,
    inference(orient,[status(thm)],[t6]) ).

cnf(t156,plain,
    mult(X1,X2) = mult(op_c,mult(rd(X1,op_c),X2)),
    inference(step,[status(thm)],[t155,t15]) ).

cnf(t127,plain,
    mult(op_c,mult(rd(X1,op_c),X2)) = mult(X1,X2),
    inference(orient,[status(thm)],[t156]) ).

cnf(t132,plain,
    mult(mult(X1,op_c),X2) = mult(op_c,mult(X1,X2)),
    inference(cp,[status(thm)],[t127,t15]) ).

cnf(t142,plain,
    mult(mult(X1,op_c),X2) = mult(op_c,mult(X1,X2)),
    inference(orient,[status(thm)],[t132]) ).

cnf(goal_0,negated_conjecture,
    mult(op_c,mult(x0,x1)) != mult(mult(op_c,x0),x1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

cnf(g0_0,plain,
    mult(op_c,mult(x0,x1)) != mult(mult(x0,op_c),x1),
    inference(rw,[status(thm)],[goal_0,t35]) ).

cnf(g0_1,plain,
    mult(op_c,mult(x0,x1)) != mult(op_c,mult(x0,x1)),
    inference(rw,[status(thm)],[g0_0,t142]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP665-10 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.10/0.59  % Computer : n018.cluster.edu
% 0.10/0.59  % Model    : x86_64 x86_64
% 0.10/0.59  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.59  % Memory   : 8046.5625MB
% 0.10/0.59  % OS       : Linux 6.8.0-71-generic
% 0.10/0.59  % CPULimit : 300
% 0.10/0.59  % WCLimit  : 300
% 0.10/0.59  % DateTime : Wed Sep 23 15:36:47 UTC 2026
% 0.10/0.59  % CPUTime  : 
% 0.10/0.59  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 5.82/1.53  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.82/1.53  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------