↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : LAT241-10 : TPTP v9.2.1. Released v7.5.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 : n028.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 04:37:44 PM UTC 2026

% Result   : Unsatisfiable 1.63s 1.84s
% Output   : CNFRefutation 1.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   49 (  49 unt;   0 nHn;  11 RR)
%            Number of literals    :   49 (  48 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-4 aty)
%            Number of variables   :   74 (  10 sgn)

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

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

cnf(complement_join,axiom,
    join(X1,complement(X1)) = one,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement_join) ).

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

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

cnf(prove_distributivity_hypothesis,hypothesis,
    meet(b,a) = a,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_distributivity_hypothesis) ).

cnf(complement_meet,axiom,
    meet(X1,complement(X1)) = zero,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement_meet) ).

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

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

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

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

cnf(prove_distributivity,negated_conjecture,
    join(complement(b),complement(a)) != complement(a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_distributivity) ).

cnf(meet_join_complement,axiom,
    ifeq(join(X1,X2),one,ifeq(meet(X1,X2),zero,complement(X1),X2),X2) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meet_join_complement) ).

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

cnf(c_0_14,axiom,
    join(join(X1,X2),X3) = join(X1,join(X2,X3)),
    associativity_of_join ).

cnf(c_0_15,axiom,
    join(X1,X1) = X1,
    idempotence_of_join ).

cnf(c_0_16,plain,
    join(X1,join(X1,X2)) = join(X1,X2),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_17,axiom,
    join(X1,complement(X1)) = one,
    complement_join ).

cnf(c_0_18,axiom,
    join(X1,meet(X1,X2)) = X1,
    absorption2 ).

cnf(c_0_19,axiom,
    meet(X1,X2) = meet(X2,X1),
    commutativity_of_meet ).

cnf(c_0_20,hypothesis,
    meet(b,a) = a,
    prove_distributivity_hypothesis ).

cnf(c_0_21,axiom,
    meet(X1,complement(X1)) = zero,
    complement_meet ).

cnf(c_0_22,axiom,
    join(X1,X2) = join(X2,X1),
    commutativity_of_join ).

cnf(c_0_23,plain,
    join(X1,one) = one,
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_24,plain,
    join(X1,meet(X2,X1)) = X1,
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_25,hypothesis,
    meet(a,b) = a,
    inference(rw,[status(thm)],[c_0_20,c_0_19]) ).

cnf(c_0_26,plain,
    join(X1,zero) = X1,
    inference(spm,[status(thm)],[c_0_18,c_0_21]) ).

cnf(c_0_27,plain,
    join(X1,join(complement(X1),X2)) = join(one,X2),
    inference(spm,[status(thm)],[c_0_14,c_0_17]) ).

cnf(c_0_28,plain,
    join(one,X1) = one,
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_29,plain,
    join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_22]),c_0_14]) ).

cnf(c_0_30,hypothesis,
    join(a,b) = b,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_22]) ).

cnf(c_0_31,axiom,
    meet(X1,join(X2,meet(X3,join(X1,X4)))) = meet(X1,join(X2,join(meet(X1,X3),meet(X3,X4)))),
    equation_H51 ).

cnf(c_0_32,plain,
    join(zero,X1) = X1,
    inference(spm,[status(thm)],[c_0_22,c_0_26]) ).

cnf(c_0_33,plain,
    join(X1,join(complement(X1),X2)) = one,
    inference(rw,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_34,hypothesis,
    join(a,join(X1,b)) = join(X1,b),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_35,axiom,
    meet(X1,join(X1,X2)) = X1,
    absorption1 ).

cnf(c_0_36,plain,
    meet(X1,join(X2,meet(complement(X1),join(X1,X3)))) = meet(X1,join(X2,meet(complement(X1),X3))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_21]),c_0_32]) ).

cnf(c_0_37,hypothesis,
    join(b,complement(a)) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_22]) ).

cnf(c_0_38,plain,
    meet(X1,one) = X1,
    inference(spm,[status(thm)],[c_0_35,c_0_17]) ).

cnf(c_0_39,axiom,
    meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
    associativity_of_meet ).

cnf(c_0_40,hypothesis,
    meet(b,join(X1,meet(complement(a),complement(b)))) = meet(b,join(X1,complement(b))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_19]) ).

cnf(c_0_41,hypothesis,
    meet(a,meet(b,X1)) = meet(a,X1),
    inference(spm,[status(thm)],[c_0_39,c_0_25]) ).

cnf(c_0_42,hypothesis,
    meet(b,join(complement(a),complement(b))) = meet(b,complement(a)),
    inference(spm,[status(thm)],[c_0_40,c_0_18]) ).

cnf(c_0_43,negated_conjecture,
    join(complement(b),complement(a)) != complement(a),
    prove_distributivity ).

cnf(c_0_44,axiom,
    ifeq(join(X1,X2),one,ifeq(meet(X1,X2),zero,complement(X1),X2),X2) = X2,
    meet_join_complement ).

cnf(c_0_45,hypothesis,
    meet(a,join(complement(a),complement(b))) = zero,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_41]),c_0_21]) ).

cnf(c_0_46,axiom,
    ifeq(X1,X1,X2,X3) = X2,
    ifeq_axiom ).

cnf(c_0_47,negated_conjecture,
    join(complement(a),complement(b)) != complement(a),
    inference(rw,[status(thm)],[c_0_43,c_0_22]) ).

cnf(c_0_48,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_33]),c_0_46]),c_0_46]),c_0_47]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : LAT241-10 : TPTP v9.2.1. Released v7.5.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.33  % Computer : n028.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Mon May  4 20:56:31 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.63/1.84  % Version  : CSE_E---1.7
% 1.63/1.84  % Problem  : theBenchmark.p
% 1.63/1.84  % SZS status Unsatisfiable for theBenchmark.p
% 1.63/1.84  % SZS output start CNFRefutation
% See solution above
% 1.63/1.84  % Total time : 1.371s
%------------------------------------------------------------------------------