↑ Up

FindProof---0.1.UNS-CRf.s

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

% Computer : n020.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:25:32 PM UTC 2026

% Result   : Unsatisfiable 5.34s 1.16s
% Output   : CNFRefutation 5.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   24 (  24 unt;   0 nHn;  12 RR)
%            Number of literals    :   24 (  23 equ;   2 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    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   20 (   0 sgn)

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

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

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

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

cnf(t27,plain,
    multiply(greatest_lower_bound(identity,X1),X2) = greatest_lower_bound(X2,multiply(X1,X2)),
    inference(cp,[status(thm)],[t26,t17]) ).

cnf(t247,plain,
    greatest_lower_bound(X1,multiply(X2,X1)) = multiply(greatest_lower_bound(identity,X2),X1),
    inference(orient,[status(thm)],[t27]) ).

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

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

cnf(t252,plain,
    multiply(greatest_lower_bound(identity,inverse(X1)),X1) = greatest_lower_bound(X1,identity),
    inference(cp,[status(thm)],[t247,t37]) ).

cnf(t408,plain,
    multiply(greatest_lower_bound(identity,inverse(X1)),X1) = greatest_lower_bound(X1,identity),
    inference(orient,[status(thm)],[t252]) ).

cnf(t7,axiom,
    greatest_lower_bound(identity,inverse(a)) = inverse(a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(t64,plain,
    greatest_lower_bound(identity,inverse(a)) = inverse(a),
    inference(orient,[status(thm)],[t7]) ).

cnf(t409,plain,
    greatest_lower_bound(a,identity) = multiply(inverse(a),a),
    inference(cp,[status(thm)],[t408,t64]) ).

cnf(t5,axiom,
    greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(t47,plain,
    greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
    inference(orient,[status(thm)],[t5]) ).

cnf(t437,plain,
    greatest_lower_bound(identity,a) = multiply(inverse(a),a),
    inference(step,[status(thm)],[t409,t47]) ).

cnf(t1,axiom,
    greatest_lower_bound(identity,a) = a,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

cnf(t61,plain,
    greatest_lower_bound(identity,a) = a,
    inference(orient,[status(thm)],[t1]) ).

cnf(t438,plain,
    a = multiply(inverse(a),a),
    inference(step,[status(thm)],[t437,t61]) ).

cnf(t439,plain,
    a = identity,
    inference(step,[status(thm)],[t438,t37]) ).

cnf(t426,plain,
    a = identity,
    inference(orient,[status(thm)],[t439]) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP174-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.35  % Computer : n020.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Wed Sep 23 13:59:03 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.34/1.16  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.34/1.16  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------