↑ Up

FindProof---0.1.UNS-CRf.s

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

% Computer : n016.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:55:04 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(t3,axiom,
    meet(X1,join(X1,X2)) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

cnf(t7,plain,
    meet(X1,join(X1,X2)) = X1,
    inference(orient,[status(thm)],[t3]) ).

cnf(t1,axiom,
    join(X1,meet(X1,X2)) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

cnf(t8,plain,
    join(X1,meet(X1,X2)) = X1,
    inference(orient,[status(thm)],[t1]) ).

cnf(t10,plain,
    X1 = meet(X1,X1),
    inference(cp,[status(thm)],[t7,t8]) ).

cnf(t34,plain,
    meet(X1,X1) = X1,
    inference(orient,[status(thm)],[t10]) ).

cnf(goal_0,negated_conjecture,
    meet(xx,xx) != xx,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LAT034-1 : TPTP v9.3.1. Bugfixed v2.5.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.07/0.35  % Computer : n016.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Wed Sep 23 20:08:57 UTC 2026
% 0.07/0.36  % CPUTime  : 
% 0.07/0.36  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 6.17/1.20  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.17/1.20  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------