↑ Up

FindProof---0.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : GRP566-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 : n007.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:33 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(t3,axiom,
    double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X1,X3)),double_divide(identity,X3))),double_divide(identity,identity)) = X2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

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

cnf(t7,plain,
    double_divide(X1,identity) = inverse(X1),
    inference(orient,[status(thm)],[t0]) ).

cnf(t255,plain,
    double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X1,X3)),double_divide(identity,X3))),inverse(identity)) = X2,
    inference(step,[status(thm)],[t4,t7]) ).

cnf(t8,plain,
    double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X1,X3)),double_divide(identity,X3))),inverse(identity)) = X2,
    inference(rw,[status(thm)],[t255]) ).

cnf(t69,plain,
    double_divide(double_divide(X1,double_divide(double_divide(X2,double_divide(X1,X3)),double_divide(identity,X3))),inverse(identity)) = X2,
    inference(orient,[status(thm)],[t8]) ).

cnf(t70,plain,
    X1 = double_divide(double_divide(X2,double_divide(double_divide(X1,inverse(X2)),double_divide(identity,identity))),inverse(identity)),
    inference(cp,[status(thm)],[t69,t7]) ).

cnf(t260,plain,
    X1 = double_divide(double_divide(X2,double_divide(double_divide(X1,inverse(X2)),inverse(identity))),inverse(identity)),
    inference(step,[status(thm)],[t70,t7]) ).

cnf(t116,plain,
    double_divide(double_divide(X1,double_divide(double_divide(X2,inverse(X1)),inverse(identity))),inverse(identity)) = X2,
    inference(orient,[status(thm)],[t260]) ).

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

cnf(t9,plain,
    double_divide(X1,inverse(X1)) = identity,
    inference(orient,[status(thm)],[t1]) ).

cnf(t118,plain,
    X1 = double_divide(double_divide(X1,double_divide(identity,inverse(identity))),inverse(identity)),
    inference(cp,[status(thm)],[t116,t9]) ).

cnf(t261,plain,
    X1 = double_divide(double_divide(X1,identity),inverse(identity)),
    inference(step,[status(thm)],[t118,t9]) ).

cnf(t262,plain,
    X1 = double_divide(inverse(X1),inverse(identity)),
    inference(step,[status(thm)],[t261,t7]) ).

cnf(t134,plain,
    double_divide(inverse(X1),inverse(identity)) = X1,
    inference(orient,[status(thm)],[t262]) ).

cnf(t143,plain,
    inverse(X1) = double_divide(double_divide(identity,double_divide(X1,inverse(identity))),inverse(identity)),
    inference(cp,[status(thm)],[t116,t134]) ).

cnf(t187,plain,
    double_divide(double_divide(identity,double_divide(X1,inverse(identity))),inverse(identity)) = inverse(X1),
    inference(orient,[status(thm)],[t143]) ).

cnf(t189,plain,
    inverse(identity) = double_divide(double_divide(identity,identity),inverse(identity)),
    inference(cp,[status(thm)],[t187,t9]) ).

cnf(t267,plain,
    inverse(identity) = double_divide(inverse(identity),inverse(identity)),
    inference(step,[status(thm)],[t189,t7]) ).

cnf(t268,plain,
    inverse(identity) = identity,
    inference(step,[status(thm)],[t267,t134]) ).

cnf(t207,plain,
    inverse(identity) = identity,
    inference(orient,[status(thm)],[t268]) ).

cnf(t285,plain,
    double_divide(inverse(X1),identity) = X1,
    inference(step,[status(thm)],[t134,t207]) ).

cnf(t286,plain,
    inverse(inverse(X1)) = X1,
    inference(step,[status(thm)],[t285,t7]) ).

cnf(t2,axiom,
    double_divide(double_divide(X1,X2),identity) = multiply(X2,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(t256,plain,
    inverse(double_divide(X1,X2)) = multiply(X2,X1),
    inference(step,[status(thm)],[t2,t7]) ).

cnf(t10,plain,
    inverse(double_divide(X1,X2)) = multiply(X2,X1),
    inference(orient,[status(thm)],[t256]) ).

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

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

cnf(t287,plain,
    multiply(identity,X1) = X1,
    inference(step,[status(thm)],[t286,t14]) ).

cnf(t233,plain,
    multiply(identity,X1) = X1,
    inference(rw,[status(thm)],[t287]) ).

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP566-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/0.36  % Computer : n007.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Wed Sep 23 15:03:36 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.36  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.95/1.14  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.95/1.14  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------