↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : KLE150+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/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:51:44 PM UTC 2026

% Result   : Theorem 152.72s 35.05s
% Output   : Proof 152.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   28
%            Number of leaves      :   13
% Syntax   : Number of formulae    :  125 ( 115 unt;   0 def)
%            Number of atoms       :  139 ( 121 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   36 (  22   ~;   9   |;   4   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-4 aty)
%            Number of variables   :  198 (  15 sgn  65   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f17,axiom,
    ! [A,B] :
      ( leq(A,B)
    <=> addition(A,B) = B ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',order) ).

fof(f17_nnf,plain,
    ! [A,B] :
      ( ( addition(A,B) != B
        | leq(A,B) )
      & ( addition(A,B) = B
        | ~ leq(A,B) ) ),
    inference(nnf_transformation,[status(thm)],[f17]) ).

fof(f17_sk,plain,
    ! [A,B] :
      ( ( addition(A,B) != B
        | leq(A,B) )
      & ( addition(A,B) = B
        | ~ leq(A,B) ) ),
    inference(skolemisation,[status(esa)],[f17_nnf]) ).

cnf(c18,plain,
    ( addition(X0,X1) != X1
    | leq(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f17_sk]) ).

cnf(t15,plain,
    ifeq(addition(X1,X2),X2,leq(X1,X2),true) = true,
    inference(equality_encoding,[status(esa)],[c18]) ).

cnf(t79,plain,
    ifeq(addition(X1,X2),X2,leq(X1,X2),true) = true,
    inference(orient,[status(thm)],[t15]) ).

fof(f1,axiom,
    ! [C,B,A] : addition(A,addition(B,C)) = addition(addition(A,B),C),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_associativity) ).

fof(f1_nnf,plain,
    ! [C,B,A] : addition(A,addition(B,C)) = addition(addition(A,B),C),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [A,B,C] : addition(A,addition(B,C)) = addition(addition(A,B),C),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c1,plain,
    addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(t14,plain,
    addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(t50,plain,
    addition(addition(X1,X2),X3) = addition(X1,addition(X2,X3)),
    inference(orient,[status(thm)],[t14]) ).

fof(f3,axiom,
    ! [A] : addition(A,A) = A,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence) ).

fof(f3_nnf,plain,
    ! [A] : addition(A,A) = A,
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [A] : addition(A,A) = A,
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    addition(X0,X0) = X0,
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(t0,plain,
    addition(X1,X1) = X1,
    inference(equality_encoding,[status(esa)],[c3]) ).

cnf(t26,plain,
    addition(X1,X1) = X1,
    inference(orient,[status(thm)],[t0]) ).

cnf(t53,plain,
    addition(X1,addition(X1,X2)) = addition(X1,X2),
    inference(cp,[status(thm)],[t50,t26]) ).

cnf(t148,plain,
    addition(X1,addition(X1,X2)) = addition(X1,X2),
    inference(orient,[status(thm)],[t53]) ).

cnf(t157,plain,
    true = ifeq(addition(X1,X2),addition(X1,X2),leq(X1,addition(X1,X2)),true),
    inference(cp,[status(thm)],[t79,t148]) ).

cnf(t9,plain,
    ifeq(X1,X1,X2,X3) = X2,
    introduced(definition) ).

cnf(t28,plain,
    ifeq(X1,X1,X2,X3) = X2,
    inference(orient,[status(thm)],[t9]) ).

cnf(t11169,plain,
    true = leq(X1,addition(X1,X2)),
    inference(step,[status(thm)],[t157,t28]) ).

cnf(t171,plain,
    leq(X1,addition(X1,X2)) = true,
    inference(orient,[status(thm)],[t11169]) ).

fof(f7,axiom,
    ! [A,B,C] : multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',distributivity1) ).

fof(f7_nnf,plain,
    ! [A,B,C] : multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)),
    inference(nnf_transformation,[status(thm)],[f7]) ).

fof(f7_sk,plain,
    ! [A,B,C] : multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)),
    inference(skolemisation,[status(esa)],[f7_nnf]) ).

cnf(c7,plain,
    multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
    inference(cnf_transformation,[status(esa)],[f7_sk]) ).

cnf(t18,plain,
    addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
    inference(equality_encoding,[status(esa)],[c7]) ).

cnf(t33,plain,
    addition(multiplication(X1,X2),multiplication(X1,X3)) = multiplication(X1,addition(X2,X3)),
    inference(orient,[status(thm)],[t18]) ).

fof(f5,axiom,
    ! [A] : multiplication(A,one) = A,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_right_identity) ).

fof(f5_nnf,plain,
    ! [A] : multiplication(A,one) = A,
    inference(nnf_transformation,[status(thm)],[f5]) ).

fof(f5_sk,plain,
    ! [A] : multiplication(A,one) = A,
    inference(skolemisation,[status(esa)],[f5_nnf]) ).

cnf(c5,plain,
    multiplication(X0,one) = X0,
    inference(cnf_transformation,[status(esa)],[f5_sk]) ).

cnf(t5,plain,
    multiplication(X1,one) = X1,
    inference(equality_encoding,[status(esa)],[c5]) ).

cnf(t24,plain,
    multiplication(X1,one) = X1,
    inference(orient,[status(thm)],[t5]) ).

cnf(t34,plain,
    multiplication(X1,addition(one,X2)) = addition(X1,multiplication(X1,X2)),
    inference(cp,[status(thm)],[t33,t24]) ).

cnf(t220,plain,
    addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(one,X2)),
    inference(orient,[status(thm)],[t34]) ).

cnf(t226,plain,
    true = leq(X1,multiplication(X1,addition(one,X2))),
    inference(cp,[status(thm)],[t171,t220]) ).

cnf(t398,plain,
    leq(X1,multiplication(X1,addition(one,X2))) = true,
    inference(orient,[status(thm)],[t226]) ).

fof(f14,axiom,
    ! [A] : strong_iteration(A) = addition(multiplication(A,strong_iteration(A)),one),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',infty_unfold1) ).

fof(f14_nnf,plain,
    ! [A] : strong_iteration(A) = addition(multiplication(A,strong_iteration(A)),one),
    inference(nnf_transformation,[status(thm)],[f14]) ).

fof(f14_sk,plain,
    ! [A] : strong_iteration(A) = addition(multiplication(A,strong_iteration(A)),one),
    inference(skolemisation,[status(esa)],[f14_nnf]) ).

cnf(c14,plain,
    strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
    inference(cnf_transformation,[status(esa)],[f14_sk]) ).

cnf(t10,plain,
    addition(multiplication(X1,strong_iteration(X1)),one) = strong_iteration(X1),
    inference(equality_encoding,[status(esa)],[c14]) ).

fof(f0,axiom,
    ! [A,B] : addition(A,B) = addition(B,A),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_commutativity) ).

fof(f0_nnf,plain,
    ! [A,B] : addition(A,B) = addition(B,A),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [A,B] : addition(A,B) = addition(B,A),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

cnf(c0,plain,
    addition(X0,X1) = addition(X1,X0),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(t8,plain,
    addition(X1,X2) = addition(X2,X1),
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(t45,plain,
    addition(X1,X2) = addition(X2,X1),
    inference(orient,[status(thm)],[t8]) ).

cnf(t11159,plain,
    addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
    inference(step,[status(thm)],[t10,t45]) ).

cnf(t59,plain,
    addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
    inference(orient,[status(thm)],[t11159]) ).

cnf(t152,plain,
    addition(one,multiplication(X1,strong_iteration(X1))) = addition(one,strong_iteration(X1)),
    inference(cp,[status(thm)],[t148,t59]) ).

cnf(t11167,plain,
    strong_iteration(X1) = addition(one,strong_iteration(X1)),
    inference(step,[status(thm)],[t152,t59]) ).

cnf(t166,plain,
    addition(one,strong_iteration(X1)) = strong_iteration(X1),
    inference(orient,[status(thm)],[t11167]) ).

cnf(t400,plain,
    true = leq(X1,multiplication(X1,strong_iteration(X2))),
    inference(cp,[status(thm)],[t398,t166]) ).

cnf(t409,plain,
    leq(X1,multiplication(X1,strong_iteration(X2))) = true,
    inference(orient,[status(thm)],[t400]) ).

cnf(c17,plain,
    ( addition(X0,X1) = X1
    | ~ leq(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f17_sk]) ).

cnf(t16,plain,
    ifeq(leq(X1,X2),true,addition(X1,X2),X2) = X2,
    inference(equality_encoding,[status(esa)],[c17]) ).

cnf(t29,plain,
    ifeq(leq(X1,X2),true,addition(X1,X2),X2) = X2,
    inference(orient,[status(thm)],[t16]) ).

cnf(t176,plain,
    true = leq(X1,addition(X2,X1)),
    inference(cp,[status(thm)],[t171,t45]) ).

cnf(t182,plain,
    leq(X1,addition(X2,X1)) = true,
    inference(orient,[status(thm)],[t176]) ).

cnf(t185,plain,
    true = leq(multiplication(X1,strong_iteration(X1)),strong_iteration(X1)),
    inference(cp,[status(thm)],[t182,t59]) ).

cnf(t343,plain,
    leq(multiplication(X1,strong_iteration(X1)),strong_iteration(X1)) = true,
    inference(orient,[status(thm)],[t185]) ).

cnf(t345,plain,
    strong_iteration(X1) = ifeq(true,true,addition(multiplication(X1,strong_iteration(X1)),strong_iteration(X1)),strong_iteration(X1)),
    inference(cp,[status(thm)],[t29,t343]) ).

cnf(t11227,plain,
    strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),strong_iteration(X1)),
    inference(step,[status(thm)],[t345,t28]) ).

cnf(t11228,plain,
    strong_iteration(X1) = addition(strong_iteration(X1),multiplication(X1,strong_iteration(X1))),
    inference(step,[status(thm)],[t11227,t45]) ).

fof(f8,axiom,
    ! [A,B,C] : multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',distributivity2) ).

fof(f8_nnf,plain,
    ! [A,B,C] : multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)),
    inference(nnf_transformation,[status(thm)],[f8]) ).

fof(f8_sk,plain,
    ! [A,B,C] : multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)),
    inference(skolemisation,[status(esa)],[f8_nnf]) ).

cnf(c8,plain,
    multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
    inference(cnf_transformation,[status(esa)],[f8_sk]) ).

cnf(t19,plain,
    addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
    inference(equality_encoding,[status(esa)],[c8]) ).

cnf(t37,plain,
    addition(multiplication(X1,X2),multiplication(X3,X2)) = multiplication(addition(X1,X3),X2),
    inference(orient,[status(thm)],[t19]) ).

fof(f6,axiom,
    ! [A] : multiplication(one,A) = A,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_left_identity) ).

fof(f6_nnf,plain,
    ! [A] : multiplication(one,A) = A,
    inference(nnf_transformation,[status(thm)],[f6]) ).

fof(f6_sk,plain,
    ! [A] : multiplication(one,A) = A,
    inference(skolemisation,[status(esa)],[f6_nnf]) ).

cnf(c6,plain,
    multiplication(one,X0) = X0,
    inference(cnf_transformation,[status(esa)],[f6_sk]) ).

cnf(t6,plain,
    multiplication(one,X1) = X1,
    inference(equality_encoding,[status(esa)],[c6]) ).

cnf(t25,plain,
    multiplication(one,X1) = X1,
    inference(orient,[status(thm)],[t6]) ).

cnf(t39,plain,
    multiplication(addition(one,X1),X2) = addition(X2,multiplication(X1,X2)),
    inference(cp,[status(thm)],[t37,t25]) ).

cnf(t232,plain,
    addition(X1,multiplication(X2,X1)) = multiplication(addition(one,X2),X1),
    inference(orient,[status(thm)],[t39]) ).

cnf(t11229,plain,
    strong_iteration(X1) = multiplication(addition(one,X1),strong_iteration(X1)),
    inference(step,[status(thm)],[t11228,t232]) ).

cnf(t1623,plain,
    multiplication(addition(one,X1),strong_iteration(X1)) = strong_iteration(X1),
    inference(orient,[status(thm)],[t11229]) ).

cnf(t1663,plain,
    true = leq(addition(one,X1),strong_iteration(X1)),
    inference(cp,[status(thm)],[t409,t1623]) ).

cnf(t1670,plain,
    leq(addition(one,X1),strong_iteration(X1)) = true,
    inference(orient,[status(thm)],[t1663]) ).

fof(f4,axiom,
    ! [A,B,C] : multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_associativity) ).

fof(f4_nnf,plain,
    ! [A,B,C] : multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C),
    inference(nnf_transformation,[status(thm)],[f4]) ).

fof(f4_sk,plain,
    ! [A,B,C] : multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C),
    inference(skolemisation,[status(esa)],[f4_nnf]) ).

cnf(c4,plain,
    multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
    inference(cnf_transformation,[status(esa)],[f4_sk]) ).

cnf(t17,plain,
    multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
    inference(equality_encoding,[status(esa)],[c4]) ).

cnf(t32,plain,
    multiplication(multiplication(X1,X2),X3) = multiplication(X1,multiplication(X2,X3)),
    inference(orient,[status(thm)],[t17]) ).

cnf(t61,plain,
    strong_iteration(multiplication(X1,X2)) = addition(one,multiplication(X1,multiplication(X2,strong_iteration(multiplication(X1,X2))))),
    inference(cp,[status(thm)],[t59,t32]) ).

cnf(t10993,plain,
    addition(one,multiplication(X1,multiplication(X2,strong_iteration(multiplication(X1,X2))))) = strong_iteration(multiplication(X1,X2)),
    inference(orient,[status(thm)],[t61]) ).

fof(f9,axiom,
    ! [A] : multiplication(zero,A) = zero,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_annihilation) ).

fof(f9_nnf,plain,
    ! [A] : multiplication(zero,A) = zero,
    inference(nnf_transformation,[status(thm)],[f9]) ).

fof(f9_sk,plain,
    ! [A] : multiplication(zero,A) = zero,
    inference(skolemisation,[status(esa)],[f9_nnf]) ).

cnf(c9,plain,
    multiplication(zero,X0) = zero,
    inference(cnf_transformation,[status(esa)],[f9_sk]) ).

cnf(t7,plain,
    multiplication(zero,X1) = zero,
    inference(equality_encoding,[status(esa)],[c9]) ).

cnf(t43,plain,
    multiplication(zero,X1) = zero,
    inference(orient,[status(thm)],[t7]) ).

cnf(t10995,plain,
    strong_iteration(multiplication(X1,zero)) = addition(one,multiplication(X1,zero)),
    inference(cp,[status(thm)],[t10993,t43]) ).

cnf(t11108,plain,
    addition(one,multiplication(X1,zero)) = strong_iteration(multiplication(X1,zero)),
    inference(orient,[status(thm)],[t10995]) ).

cnf(hi18,axiom,
    ifeq(addition(X0,X1),X1,leq(X0,X1),true) = true,
    inference(equality_encoding,[status(esa)],[c18]) ).

cnf(hi3,axiom,
    addition(X0,X0) = X0,
    inference(equality_encoding,[status(esa)],[c3]) ).

cnf(t3,plain,
    leq(X1,X1) = true,
    inference(hyper_resolution,[status(thm)],[hi18,hi3]) ).

cnf(t78,plain,
    leq(X1,X1) = true,
    inference(orient,[status(thm)],[t3]) ).

cnf(t168,plain,
    true = ifeq(strong_iteration(X1),strong_iteration(X1),leq(one,strong_iteration(X1)),true),
    inference(cp,[status(thm)],[t79,t166]) ).

cnf(t11168,plain,
    true = leq(one,strong_iteration(X1)),
    inference(step,[status(thm)],[t168,t28]) ).

cnf(t170,plain,
    leq(one,strong_iteration(X1)) = true,
    inference(orient,[status(thm)],[t11168]) ).

fof(f18,conjecture,
    ! [X0] :
      ( leq(addition(one,multiplication(X0,zero)),strong_iteration(multiplication(X0,zero)))
      & leq(strong_iteration(multiplication(X0,zero)),addition(one,multiplication(X0,zero))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(f18_neg,negated_conjecture,
    ~ ! [X0] :
        ( leq(addition(one,multiplication(X0,zero)),strong_iteration(multiplication(X0,zero)))
        & leq(strong_iteration(multiplication(X0,zero)),addition(one,multiplication(X0,zero))) ),
    inference(negated_conjecture,[status(cth)],[f18]) ).

fof(f18_nnf,plain,
    ? [X0] :
      ( ~ leq(addition(one,multiplication(X0,zero)),strong_iteration(multiplication(X0,zero)))
      | ~ leq(strong_iteration(multiplication(X0,zero)),addition(one,multiplication(X0,zero))) ),
    inference(nnf_transformation,[status(thm)],[f18_neg]) ).

fof(f18_sk,plain,
    ( ~ leq(addition(one,multiplication(sk0,zero)),strong_iteration(multiplication(sk0,zero)))
    | ~ leq(strong_iteration(multiplication(sk0,zero)),addition(one,multiplication(sk0,zero))) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f18_nnf]) ).

cnf(c19,plain,
    ( ~ leq(addition(one,multiplication(sk0,zero)),strong_iteration(multiplication(sk0,zero)))
    | ~ leq(strong_iteration(multiplication(sk0,zero)),addition(one,multiplication(sk0,zero))) ),
    inference(cnf_transformation,[status(esa)],[f18_sk]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c19]) ).

cnf(g0_0,plain,
    true != ifeq(leq(strong_iteration(multiplication(sk0,zero)),addition(one,multiplication(sk0,zero))),true,ifeq(leq(addition(one,multiplication(sk0,zero)),strong_iteration(multiplication(sk0,zero))),true,false,true),true),
    inference(rw,[status(thm)],[goal_0]) ).

cnf(g0_1,plain,
    true != ifeq(leq(strong_iteration(multiplication(sk0,zero)),addition(one,multiplication(sk0,zero))),leq(one,strong_iteration(one)),ifeq(leq(addition(one,multiplication(sk0,zero)),strong_iteration(multiplication(sk0,zero))),true,false,true),true),
    inference(rw,[status(thm)],[g0_0]) ).

cnf(g0_2,plain,
    true != ifeq(leq(strong_iteration(multiplication(sk0,zero)),addition(one,multiplication(sk0,zero))),leq(one,strong_iteration(one)),ifeq(true,true,false,true),true),
    inference(rw,[status(thm)],[g0_1,t1670]) ).

cnf(g0_3,plain,
    true != ifeq(leq(strong_iteration(multiplication(sk0,zero)),addition(one,multiplication(sk0,zero))),leq(one,strong_iteration(one)),false,true),
    inference(rw,[status(thm)],[g0_2,t28]) ).

cnf(g0_4,plain,
    true != ifeq(leq(strong_iteration(multiplication(sk0,zero)),strong_iteration(multiplication(sk0,zero))),leq(one,strong_iteration(one)),false,true),
    inference(rw,[status(thm)],[g0_3,t11108]) ).

cnf(g0_5,plain,
    true != ifeq(true,leq(one,strong_iteration(one)),false,true),
    inference(rw,[status(thm)],[g0_4,t78]) ).

cnf(g0_6,plain,
    true != ifeq(true,true,false,true),
    inference(rw,[status(thm)],[g0_5,t170]) ).

cnf(g0_7,plain,
    true != false,
    inference(rw,[status(thm)],[g0_6,t28]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : KLE150+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/15.39  % Computer : n016.cluster.edu
% 0.09/15.39  % Model    : x86_64 x86_64
% 0.09/15.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/15.39  % Memory   : 8046.5625MB
% 0.09/15.39  % OS       : Linux 6.8.0-71-generic
% 0.09/15.39  % CPULimit : 300
% 0.09/15.39  % WCLimit  : 300
% 0.09/15.39  % DateTime : Wed Sep 23 19:11:43 UTC 2026
% 0.13/15.40  % CPUTime  : 
% 0.13/15.40  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 152.72/35.05  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 152.72/35.05  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------