↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : REL002+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n019.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 02:34:35 PM UTC 2026

% Result   : Theorem 5.28s 1.38s
% Output   : Proof 5.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   28
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   85 (  85 unt;   0 def)
%            Number of atoms       :   85 (  84 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    6 (   6   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-2 aty)
%            Number of variables   :  121 (   8 sgn  44   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1,X2] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',maddux2_join_associativity) ).

fof(f1_nnf,plain,
    ! [X0,X1,X2] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [X0,X1,X2] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

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

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

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

fof(f11,axiom,
    ! [X0] : top = join(X0,complement(X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',def_top) ).

fof(f11_nnf,plain,
    ! [X0] : top = join(X0,complement(X0)),
    inference(nnf_transformation,[status(thm)],[f11]) ).

fof(f11_sk,plain,
    ! [X0] : top = join(X0,complement(X0)),
    inference(skolemisation,[status(esa)],[f11_nnf]) ).

cnf(c11,plain,
    top = join(X0,complement(X0)),
    inference(cnf_transformation,[status(esa)],[f11_sk]) ).

cnf(t2,plain,
    join(X1,complement(X1)) = top,
    inference(equality_encoding,[status(esa)],[c11]) ).

cnf(t23,plain,
    join(X1,complement(X1)) = top,
    inference(orient,[status(thm)],[t2]) ).

cnf(t25,plain,
    join(X1,join(complement(X1),X2)) = join(top,X2),
    inference(cp,[status(thm)],[t20,t23]) ).

cnf(t247,plain,
    join(X1,join(complement(X1),X2)) = join(top,X2),
    inference(orient,[status(thm)],[t25]) ).

fof(f3,axiom,
    ! [X0,X1] : meet(X0,X1) = complement(join(complement(X0),complement(X1))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',maddux4_definiton_of_meet) ).

fof(f3_nnf,plain,
    ! [X0,X1] : meet(X0,X1) = complement(join(complement(X0),complement(X1))),
    inference(nnf_transformation,[status(thm)],[f3]) ).

fof(f3_sk,plain,
    ! [X0,X1] : meet(X0,X1) = complement(join(complement(X0),complement(X1))),
    inference(skolemisation,[status(esa)],[f3_nnf]) ).

cnf(c3,plain,
    meet(X0,X1) = complement(join(complement(X0),complement(X1))),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(t5,plain,
    complement(join(complement(X1),complement(X2))) = meet(X1,X2),
    inference(equality_encoding,[status(esa)],[c3]) ).

cnf(t38,plain,
    complement(join(complement(X1),complement(X2))) = meet(X1,X2),
    inference(orient,[status(thm)],[t5]) ).

fof(f10,axiom,
    ! [X0,X1] : join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)) = complement(X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',converse_cancellativity) ).

fof(f10_nnf,plain,
    ! [X0,X1] : join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)) = complement(X1),
    inference(nnf_transformation,[status(thm)],[f10]) ).

fof(f10_sk,plain,
    ! [X0,X1] : join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)) = complement(X1),
    inference(skolemisation,[status(esa)],[f10_nnf]) ).

cnf(c10,plain,
    join(composition(converse(X0),complement(composition(X0,X1))),complement(X1)) = complement(X1),
    inference(cnf_transformation,[status(esa)],[f10_sk]) ).

cnf(t11,plain,
    join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
    inference(equality_encoding,[status(esa)],[c10]) ).

fof(f0,axiom,
    ! [X0,X1] : join(X0,X1) = join(X1,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',maddux1_join_commutativity) ).

fof(f0_nnf,plain,
    ! [X0,X1] : join(X0,X1) = join(X1,X0),
    inference(nnf_transformation,[status(thm)],[f0]) ).

fof(f0_sk,plain,
    ! [X0,X1] : join(X0,X1) = join(X1,X0),
    inference(skolemisation,[status(esa)],[f0_nnf]) ).

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

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

cnf(t18,plain,
    join(X1,X2) = join(X2,X1),
    inference(orient,[status(thm)],[t4]) ).

cnf(t283,plain,
    join(complement(X2),composition(converse(X1),complement(composition(X1,X2)))) = complement(X2),
    inference(step,[status(thm)],[t11,t18]) ).

cnf(t29,plain,
    join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
    inference(orient,[status(thm)],[t283]) ).

fof(f9,axiom,
    ! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',converse_multiplicativity) ).

fof(f9_nnf,plain,
    ! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
    inference(nnf_transformation,[status(thm)],[f9]) ).

fof(f9_sk,plain,
    ! [X0,X1] : converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
    inference(skolemisation,[status(esa)],[f9_nnf]) ).

cnf(c9,plain,
    converse(composition(X0,X1)) = composition(converse(X1),converse(X0)),
    inference(cnf_transformation,[status(esa)],[f9_sk]) ).

cnf(t6,plain,
    composition(converse(X1),converse(X2)) = converse(composition(X2,X1)),
    inference(equality_encoding,[status(esa)],[c9]) ).

cnf(t50,plain,
    composition(converse(X1),converse(X2)) = converse(composition(X2,X1)),
    inference(orient,[status(thm)],[t6]) ).

fof(f7,axiom,
    ! [X0] : converse(converse(X0)) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',converse_idempotence) ).

fof(f7_nnf,plain,
    ! [X0] : converse(converse(X0)) = X0,
    inference(nnf_transformation,[status(thm)],[f7]) ).

fof(f7_sk,plain,
    ! [X0] : converse(converse(X0)) = X0,
    inference(skolemisation,[status(esa)],[f7_nnf]) ).

cnf(c7,plain,
    converse(converse(X0)) = X0,
    inference(cnf_transformation,[status(esa)],[f7_sk]) ).

cnf(t1,plain,
    converse(converse(X1)) = X1,
    inference(equality_encoding,[status(esa)],[c7]) ).

cnf(t17,plain,
    converse(converse(X1)) = X1,
    inference(orient,[status(thm)],[t1]) ).

cnf(t52,plain,
    converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
    inference(cp,[status(thm)],[t50,t17]) ).

cnf(t127,plain,
    converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
    inference(orient,[status(thm)],[t52]) ).

fof(f5,axiom,
    ! [X0] : composition(X0,one) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',composition_identity) ).

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

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

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

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

cnf(t16,plain,
    composition(X1,one) = X1,
    inference(orient,[status(thm)],[t0]) ).

cnf(t128,plain,
    composition(converse(one),X1) = converse(converse(X1)),
    inference(cp,[status(thm)],[t127,t16]) ).

cnf(t288,plain,
    composition(converse(one),X1) = X1,
    inference(step,[status(thm)],[t128,t17]) ).

cnf(t142,plain,
    composition(converse(one),X1) = X1,
    inference(orient,[status(thm)],[t288]) ).

cnf(t143,plain,
    one = converse(one),
    inference(cp,[status(thm)],[t142,t16]) ).

cnf(t149,plain,
    converse(one) = one,
    inference(orient,[status(thm)],[t143]) ).

cnf(t289,plain,
    composition(one,X1) = X1,
    inference(step,[status(thm)],[t142,t149]) ).

cnf(t159,plain,
    composition(one,X1) = X1,
    inference(rw,[status(thm)],[t289]) ).

cnf(t160,plain,
    composition(one,X1) = X1,
    inference(orient,[status(thm)],[t159]) ).

cnf(t163,plain,
    complement(X1) = join(complement(X1),composition(converse(one),complement(X1))),
    inference(cp,[status(thm)],[t29,t160]) ).

cnf(t291,plain,
    complement(X1) = join(complement(X1),composition(one,complement(X1))),
    inference(step,[status(thm)],[t163,t149]) ).

cnf(t292,plain,
    complement(X1) = join(complement(X1),complement(X1)),
    inference(step,[status(thm)],[t291,t160]) ).

cnf(t187,plain,
    join(complement(X1),complement(X1)) = complement(X1),
    inference(orient,[status(thm)],[t292]) ).

cnf(t197,plain,
    meet(X1,X1) = complement(complement(X1)),
    inference(cp,[status(thm)],[t38,t187]) ).

cnf(t204,plain,
    meet(X1,X1) = complement(complement(X1)),
    inference(orient,[status(thm)],[t197]) ).

cnf(t209,plain,
    top = join(complement(X1),meet(X1,X1)),
    inference(cp,[status(thm)],[t23,t204]) ).

cnf(t225,plain,
    join(complement(X1),meet(X1,X1)) = top,
    inference(orient,[status(thm)],[t209]) ).

cnf(t251,plain,
    join(top,meet(X1,X1)) = join(X1,top),
    inference(cp,[status(thm)],[t247,t225]) ).

cnf(t253,plain,
    join(top,complement(X1)) = join(X1,complement(X1)),
    inference(cp,[status(thm)],[t247,t187]) ).

cnf(t299,plain,
    join(top,complement(X1)) = top,
    inference(step,[status(thm)],[t253,t23]) ).

cnf(t264,plain,
    join(top,complement(X1)) = top,
    inference(orient,[status(thm)],[t299]) ).

cnf(t265,plain,
    top = join(top,meet(X1,X2)),
    inference(cp,[status(thm)],[t264,t38]) ).

cnf(t272,plain,
    join(top,meet(X1,X2)) = top,
    inference(orient,[status(thm)],[t265]) ).

cnf(t301,plain,
    top = join(X1,top),
    inference(step,[status(thm)],[t251,t272]) ).

cnf(t277,plain,
    join(X1,top) = top,
    inference(orient,[status(thm)],[t301]) ).

fof(f13,conjecture,
    ! [X0] : join(X0,top) = top,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(f13_neg,negated_conjecture,
    ~ ! [X0] : join(X0,top) = top,
    inference(negated_conjecture,[status(cth)],[f13]) ).

fof(f13_nnf,plain,
    ? [X0] : join(X0,top) != top,
    inference(nnf_transformation,[status(thm)],[f13_neg]) ).

fof(f13_sk,plain,
    join(sk0,top) != top,
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f13_nnf]) ).

cnf(c13,plain,
    join(sk0,top) != top,
    inference(cnf_transformation,[status(esa)],[f13_sk]) ).

cnf(goal_0,negated_conjecture,
    join(sk0,top) != top,
    inference(equality_encoding,[status(esa)],[c13]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : REL002+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.42  % Computer : n019.cluster.edu
% 0.10/0.42  % Model    : x86_64 x86_64
% 0.10/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.42  % Memory   : 8046.5625MB
% 0.10/0.42  % OS       : Linux 6.8.0-71-generic
% 0.10/0.42  % CPULimit : 300
% 0.10/0.42  % WCLimit  : 300
% 0.10/0.42  % DateTime : Thu Sep 24 07:06:04 UTC 2026
% 0.10/0.42  % CPUTime  : 
% 0.10/0.42  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 5.28/1.38  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.28/1.38  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------