↑ Up

FindProof---0.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : GRP163-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 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:25:28 PM UTC 2026

% Result   : Unsatisfiable 5.62s 1.24s
% Output   : CNFRefutation 5.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   19 (  19 unt;   0 nHn;  15 RR)
%            Number of literals    :   19 (  18 equ;   8 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    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   10 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(t1,axiom,
    greatest_lower_bound(a,b) = a,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

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

cnf(t71,plain,
    greatest_lower_bound(b,a) = a,
    inference(step,[status(thm)],[t1,t48]) ).

cnf(t62,plain,
    greatest_lower_bound(b,a) = a,
    inference(orient,[status(thm)],[t71]) ).

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

cnf(t52,plain,
    greatest_lower_bound(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(X1,greatest_lower_bound(X2,X3)),
    inference(orient,[status(thm)],[t10]) ).

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

cnf(t73,plain,
    greatest_lower_bound(c,b) = b,
    inference(step,[status(thm)],[t2,t48]) ).

cnf(t68,plain,
    greatest_lower_bound(c,b) = b,
    inference(orient,[status(thm)],[t73]) ).

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

cnf(g0_0,plain,
    greatest_lower_bound(a,c) != greatest_lower_bound(greatest_lower_bound(b,a),c),
    inference(rw,[status(thm)],[goal_0,t62]) ).

cnf(g0_1,plain,
    greatest_lower_bound(a,c) != greatest_lower_bound(greatest_lower_bound(a,b),c),
    inference(rw,[status(thm)],[g0_0,t48]) ).

cnf(g0_2,plain,
    greatest_lower_bound(a,c) != greatest_lower_bound(a,greatest_lower_bound(b,c)),
    inference(rw,[status(thm)],[g0_1,t52]) ).

cnf(g0_3,plain,
    greatest_lower_bound(a,c) != greatest_lower_bound(a,greatest_lower_bound(c,b)),
    inference(rw,[status(thm)],[g0_2,t48]) ).

cnf(g0_4,plain,
    greatest_lower_bound(a,c) != greatest_lower_bound(greatest_lower_bound(c,b),a),
    inference(rw,[status(thm)],[g0_3,t48]) ).

cnf(g0_5,plain,
    greatest_lower_bound(b,a) != greatest_lower_bound(greatest_lower_bound(c,b),a),
    inference(rw,[status(thm)],[g0_4,t62]) ).

cnf(g0_6,plain,
    greatest_lower_bound(greatest_lower_bound(c,b),a) != greatest_lower_bound(greatest_lower_bound(c,b),a),
    inference(rw,[status(thm)],[g0_5,t68]) ).

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

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