↑ Up

CSE_E---1.7.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : REL008+4 : TPTP v9.2.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n008.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May  5 05:04:13 PM UTC 2026

% Result   : Theorem 6.74s 4.71s
% Output   : CNFRefutation 6.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   67 (  60 unt;   0 def)
%            Number of atoms       :   74 (  73 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   18 (  11   ~;   5   |;   2   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-2 aty)
%            Number of variables   :  108 (   0 sgn  50   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
    ! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_multiplicativity) ).

fof(composition_identity,axiom,
    ! [X1] : composition(X1,one) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_identity) ).

fof(converse_idempotence,axiom,
    ! [X1] : converse(converse(X1)) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).

fof(converse_cancellativity,axiom,
    ! [X1,X2] : join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_cancellativity) ).

fof(maddux1_join_commutativity,axiom,
    ! [X1,X2] : join(X1,X2) = join(X2,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux1_join_commutativity) ).

fof(def_zero,axiom,
    ! [X1] : zero = meet(X1,complement(X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',def_zero) ).

fof(maddux4_definiton_of_meet,axiom,
    ! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux4_definiton_of_meet) ).

fof(def_top,axiom,
    ! [X1] : top = join(X1,complement(X1)),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',def_top) ).

fof(maddux3_a_kind_of_de_Morgan,axiom,
    ! [X1,X2] : X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux3_a_kind_of_de_Morgan) ).

fof(maddux2_join_associativity,axiom,
    ! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux2_join_associativity) ).

fof(goals,conjecture,
    ! [X1,X2,X3] :
      ( join(join(composition(X1,join(X2,X3)),composition(X1,X2)),composition(X1,X3)) = join(composition(X1,X2),composition(X1,X3))
      & join(join(composition(X1,X2),composition(X1,X3)),composition(X1,join(X2,X3))) = composition(X1,join(X2,X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

fof(converse_additivity,axiom,
    ! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_additivity) ).

fof(composition_distributivity,axiom,
    ! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
    file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_distributivity) ).

fof(c_0_13,plain,
    ! [X60,X61] : converse(composition(X60,X61)) = composition(converse(X61),converse(X60)),
    inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).

fof(c_0_14,plain,
    ! [X53] : composition(X53,one) = X53,
    inference(variable_rename,[status(thm)],[composition_identity]) ).

cnf(c_0_15,plain,
    converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_16,plain,
    composition(X1,one) = X1,
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_17,plain,
    ! [X57] : converse(converse(X57)) = X57,
    inference(variable_rename,[status(thm)],[converse_idempotence]) ).

cnf(c_0_18,plain,
    composition(converse(one),converse(X1)) = converse(X1),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,plain,
    converse(converse(X1)) = X1,
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

fof(c_0_20,plain,
    ! [X62,X63] : join(composition(converse(X62),complement(composition(X62,X63))),complement(X63)) = complement(X63),
    inference(variable_rename,[status(thm)],[converse_cancellativity]) ).

fof(c_0_21,plain,
    ! [X41,X42] : join(X41,X42) = join(X42,X41),
    inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).

cnf(c_0_22,plain,
    composition(converse(one),X1) = X1,
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

fof(c_0_23,plain,
    ! [X65] : zero = meet(X65,complement(X65)),
    inference(variable_rename,[status(thm)],[def_zero]) ).

fof(c_0_24,plain,
    ! [X48,X49] : meet(X48,X49) = complement(join(complement(X48),complement(X49))),
    inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).

cnf(c_0_25,plain,
    join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_26,plain,
    join(X1,X2) = join(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_27,plain,
    converse(one) = one,
    inference(spm,[status(thm)],[c_0_16,c_0_22]) ).

cnf(c_0_28,plain,
    zero = meet(X1,complement(X1)),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_29,plain,
    meet(X1,X2) = complement(join(complement(X1),complement(X2))),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

fof(c_0_30,plain,
    ! [X64] : top = join(X64,complement(X64)),
    inference(variable_rename,[status(thm)],[def_top]) ).

cnf(c_0_31,plain,
    join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
    inference(rw,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_32,plain,
    composition(one,X1) = X1,
    inference(rw,[status(thm)],[c_0_22,c_0_27]) ).

cnf(c_0_33,plain,
    zero = complement(join(complement(X1),complement(complement(X1)))),
    inference(rw,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_34,plain,
    top = join(X1,complement(X1)),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

fof(c_0_35,plain,
    ! [X46,X47] : X46 = join(complement(join(complement(X46),complement(X47))),complement(join(complement(X46),X47))),
    inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).

fof(c_0_36,plain,
    ! [X43,X44,X45] : join(X43,join(X44,X45)) = join(join(X43,X44),X45),
    inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).

cnf(c_0_37,plain,
    join(complement(X1),complement(X1)) = complement(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_27]),c_0_32]) ).

cnf(c_0_38,plain,
    complement(top) = zero,
    inference(rw,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_39,plain,
    X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
    inference(split_conjunct,[status(thm)],[c_0_35]) ).

cnf(c_0_40,plain,
    join(X1,join(X2,X3)) = join(join(X1,X2),X3),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_41,plain,
    join(zero,zero) = zero,
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_42,plain,
    join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
    inference(rw,[status(thm)],[c_0_39,c_0_26]) ).

fof(c_0_43,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( join(join(composition(X1,join(X2,X3)),composition(X1,X2)),composition(X1,X3)) = join(composition(X1,X2),composition(X1,X3))
        & join(join(composition(X1,X2),composition(X1,X3)),composition(X1,join(X2,X3))) = composition(X1,join(X2,X3)) ),
    inference(assume_negation,[status(cth)],[goals]) ).

fof(c_0_44,plain,
    ! [X58,X59] : converse(join(X58,X59)) = join(converse(X58),converse(X59)),
    inference(variable_rename,[status(thm)],[converse_additivity]) ).

fof(c_0_45,plain,
    ! [X54,X55,X56] : composition(join(X54,X55),X56) = join(composition(X54,X56),composition(X55,X56)),
    inference(variable_rename,[status(thm)],[composition_distributivity]) ).

cnf(c_0_46,plain,
    join(zero,join(zero,X1)) = join(zero,X1),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_47,plain,
    join(zero,complement(complement(X1))) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_37]),c_0_34]),c_0_38]),c_0_26]) ).

fof(c_0_48,negated_conjecture,
    ( join(join(composition(esk1_0,join(esk2_0,esk3_0)),composition(esk1_0,esk2_0)),composition(esk1_0,esk3_0)) != join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0))
    | join(join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0)),composition(esk1_0,join(esk2_0,esk3_0))) != composition(esk1_0,join(esk2_0,esk3_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_43])])]) ).

cnf(c_0_49,plain,
    converse(join(X1,X2)) = join(converse(X1),converse(X2)),
    inference(split_conjunct,[status(thm)],[c_0_44]) ).

cnf(c_0_50,plain,
    composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
    inference(split_conjunct,[status(thm)],[c_0_45]) ).

cnf(c_0_51,plain,
    join(zero,X1) = X1,
    inference(spm,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_52,negated_conjecture,
    ( join(join(composition(esk1_0,join(esk2_0,esk3_0)),composition(esk1_0,esk2_0)),composition(esk1_0,esk3_0)) != join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0))
    | join(join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0)),composition(esk1_0,join(esk2_0,esk3_0))) != composition(esk1_0,join(esk2_0,esk3_0)) ),
    inference(split_conjunct,[status(thm)],[c_0_48]) ).

cnf(c_0_53,plain,
    join(composition(converse(X1),converse(X2)),composition(converse(X1),converse(X3))) = composition(converse(X1),join(converse(X2),converse(X3))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_15]),c_0_49]),c_0_15]),c_0_15]) ).

cnf(c_0_54,plain,
    complement(complement(X1)) = X1,
    inference(rw,[status(thm)],[c_0_47,c_0_51]) ).

cnf(c_0_55,negated_conjecture,
    ( join(composition(esk1_0,esk3_0),join(composition(esk1_0,esk2_0),composition(esk1_0,join(esk2_0,esk3_0)))) != join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0))
    | join(composition(esk1_0,join(esk2_0,esk3_0)),join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0))) != composition(esk1_0,join(esk2_0,esk3_0)) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_26]),c_0_26]),c_0_26]) ).

cnf(c_0_56,plain,
    join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
    inference(spm,[status(thm)],[c_0_26,c_0_40]) ).

cnf(c_0_57,plain,
    join(composition(X1,converse(X2)),composition(X1,converse(X3))) = composition(X1,join(converse(X2),converse(X3))),
    inference(spm,[status(thm)],[c_0_53,c_0_19]) ).

cnf(c_0_58,plain,
    join(X1,X1) = X1,
    inference(spm,[status(thm)],[c_0_37,c_0_54]) ).

cnf(c_0_59,negated_conjecture,
    ( join(composition(esk1_0,esk3_0),join(composition(esk1_0,esk2_0),composition(esk1_0,join(esk2_0,esk3_0)))) != join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0))
    | join(composition(esk1_0,esk2_0),join(composition(esk1_0,esk3_0),composition(esk1_0,join(esk2_0,esk3_0)))) != composition(esk1_0,join(esk2_0,esk3_0)) ),
    inference(rw,[status(thm)],[c_0_55,c_0_56]) ).

cnf(c_0_60,plain,
    join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_26]),c_0_40]) ).

cnf(c_0_61,plain,
    join(composition(X1,converse(X2)),composition(X1,X3)) = composition(X1,join(converse(X2),X3)),
    inference(spm,[status(thm)],[c_0_57,c_0_19]) ).

cnf(c_0_62,plain,
    join(X1,join(X1,X2)) = join(X1,X2),
    inference(spm,[status(thm)],[c_0_40,c_0_58]) ).

cnf(c_0_63,negated_conjecture,
    ( join(composition(esk1_0,esk2_0),join(composition(esk1_0,esk3_0),composition(esk1_0,join(esk2_0,esk3_0)))) != join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0))
    | join(composition(esk1_0,esk2_0),join(composition(esk1_0,esk3_0),composition(esk1_0,join(esk2_0,esk3_0)))) != composition(esk1_0,join(esk2_0,esk3_0)) ),
    inference(rw,[status(thm)],[c_0_59,c_0_60]) ).

cnf(c_0_64,plain,
    join(composition(X1,X2),composition(X1,X3)) = composition(X1,join(X2,X3)),
    inference(spm,[status(thm)],[c_0_61,c_0_19]) ).

cnf(c_0_65,plain,
    join(X1,join(X2,X1)) = join(X2,X1),
    inference(spm,[status(thm)],[c_0_62,c_0_26]) ).

cnf(c_0_66,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_64]),c_0_65]),c_0_64]),c_0_62]),c_0_64]),c_0_64]),c_0_65]),c_0_64]),c_0_62])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : REL008+4 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.32  % Computer : n008.cluster.edu
% 0.15/0.32  % Model    : x86_64 x86_64
% 0.15/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32  % Memory   : 8042.1875MB
% 0.15/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32  % CPULimit   : 300
% 0.15/0.32  % WCLimit    : 300
% 0.15/0.32  % DateTime   : Tue May  5 01:40:28 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 6.74/4.71  % Version  : CSE_E---1.7
% 6.74/4.71  % Problem  : theBenchmark.p
% 6.74/4.71  % SZS status Theorem for theBenchmark.p
% 6.74/4.71  % SZS output start CNFRefutation
% See solution above
% 6.74/4.73  % Total time : 3.368s
%------------------------------------------------------------------------------