↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : LAT235-1 : TPTP v9.2.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n010.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:43 PM UTC 2026

% Result   : Unsatisfiable 2.79s 3.09s
% Output   : CNFRefutation 2.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   49 (  46 unt;   0 nHn;  14 RR)
%            Number of literals    :   54 (  53 equ;   8 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   72 (  11 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(absorption2,axiom,
    join(X1,meet(X1,X2)) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption2) ).

cnf(commutativity_of_meet,axiom,
    meet(X1,X2) = meet(X2,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).

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

cnf(absorption1,axiom,
    meet(X1,join(X1,X2)) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption1) ).

cnf(complement_join,axiom,
    join(X1,complement(X1)) = one,
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-4.ax',complement_join) ).

cnf(associativity_of_join,axiom,
    join(join(X1,X2),X3) = join(X1,join(X2,X3)),
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',associativity_of_join) ).

cnf(idempotence_of_join,axiom,
    join(X1,X1) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',idempotence_of_join) ).

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

cnf(complement_meet,axiom,
    meet(X1,complement(X1)) = zero,
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-4.ax',complement_meet) ).

cnf(associativity_of_meet,axiom,
    meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).

cnf(commutativity_of_join,axiom,
    join(X1,X2) = join(X2,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).

cnf(meet_join_complement,axiom,
    ( complement(X1) = X2
    | meet(X1,X2) != zero
    | join(X1,X2) != one ),
    file('/export/starexec/sandbox/benchmark/Axioms/LAT001-4.ax',meet_join_complement) ).

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

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

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

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

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

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

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

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

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

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

cnf(c_0_22,hypothesis,
    join(b,a) = b,
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

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

cnf(c_0_24,plain,
    meet(one,X1) = X1,
    inference(spm,[status(thm)],[c_0_20,c_0_14]) ).

cnf(c_0_25,hypothesis,
    join(b,join(a,X1)) = join(b,X1),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

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

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

cnf(c_0_28,axiom,
    meet(X1,join(X2,meet(X3,X4))) = meet(X1,join(X2,meet(X3,join(X2,meet(X4,join(X2,X3)))))),
    equation_H34 ).

cnf(c_0_29,hypothesis,
    join(b,complement(a)) = join(b,one),
    inference(spm,[status(thm)],[c_0_25,c_0_17]) ).

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

cnf(c_0_31,plain,
    join(X1,join(X2,X1)) = join(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_16]),c_0_21]) ).

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

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

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

cnf(c_0_35,plain,
    join(X1,meet(X2,join(X1,meet(X3,join(X1,X2))))) = join(X1,meet(X2,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_28]),c_0_24]) ).

cnf(c_0_36,hypothesis,
    join(b,complement(a)) = one,
    inference(rw,[status(thm)],[c_0_29,c_0_30]) ).

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

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

cnf(c_0_39,axiom,
    ( complement(X1) = X2
    | meet(X1,X2) != zero
    | join(X1,X2) != one ),
    meet_join_complement ).

cnf(c_0_40,plain,
    meet(X1,meet(X2,complement(meet(X1,X2)))) = zero,
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_41,hypothesis,
    join(b,meet(complement(a),join(b,X1))) = join(b,meet(complement(a),X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_20]) ).

cnf(c_0_42,plain,
    join(X1,complement(meet(X1,X2))) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_13]),c_0_38]) ).

cnf(c_0_43,plain,
    ( meet(X1,complement(meet(X2,X1))) = complement(X2)
    | join(X2,meet(X1,complement(meet(X2,X1)))) != one ),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_44,hypothesis,
    join(b,meet(complement(a),complement(meet(b,X1)))) = one,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_20]),c_0_29]),c_0_30]) ).

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

cnf(c_0_46,hypothesis,
    meet(complement(a),complement(meet(b,complement(a)))) = complement(b),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

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

cnf(c_0_48,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_46]),c_0_47]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : LAT235-1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.10  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.11/0.30  % Computer : n010.cluster.edu
% 0.11/0.30  % Model    : x86_64 x86_64
% 0.11/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30  % Memory   : 8042.1875MB
% 0.11/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30  % CPULimit   : 300
% 0.11/0.30  % WCLimit    : 300
% 0.11/0.30  % DateTime   : Mon May  4 20:56:06 EDT 2026
% 0.11/0.30  % CPUTime    : 
% 0.11/0.31  % start to proof: theBenchmark
% 2.79/3.09  % Version  : CSE_E---1.7
% 2.79/3.09  % Problem  : theBenchmark.p
% 2.79/3.09  % SZS status Unsatisfiable for theBenchmark.p
% 2.79/3.09  % SZS output start CNFRefutation
% See solution above
% 2.79/3.10  % Total time : 2.373s
%------------------------------------------------------------------------------