↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : LAT038-1 : TPTP v9.2.1. Released v2.4.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 : n012.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:24 PM UTC 2026

% Result   : Unsatisfiable 1.68s 1.78s
% Output   : CNFRefutation 1.68s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   36 (  36 unt;   0 nHn;  15 RR)
%            Number of literals    :   36 (  35 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   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   :   47 (   7 sgn)

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

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

cnf(lhs2,hypothesis,
    meet(f(aa,dd),f(bb,dd)) = meet(f(cc,dd),f(bb,dd)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lhs2) ).

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

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

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

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

cnf(lhs1,hypothesis,
    f(join(aa,bb),dd) = f(join(cc,bb),dd),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lhs1) ).

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

cnf(rhs,negated_conjecture,
    f(aa,dd) != f(cc,dd),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rhs) ).

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

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

cnf(c_0_12,hypothesis,
    meet(f(aa,dd),f(bb,dd)) = meet(f(cc,dd),f(bb,dd)),
    lhs2 ).

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

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

cnf(c_0_15,plain,
    join(X1,meet(X2,X1)) = X1,
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_16,hypothesis,
    meet(f(bb,dd),f(aa,dd)) = meet(f(bb,dd),f(cc,dd)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_11]),c_0_11]) ).

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

cnf(c_0_18,hypothesis,
    join(f(aa,dd),meet(f(bb,dd),f(cc,dd))) = f(aa,dd),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

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

cnf(c_0_20,hypothesis,
    meet(f(bb,dd),meet(f(cc,dd),f(aa,dd))) = meet(f(bb,dd),f(cc,dd)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

cnf(c_0_21,hypothesis,
    meet(X1,join(X2,X3)) = join(meet(X1,X2),meet(X1,X3)),
    dist_meet ).

cnf(c_0_22,hypothesis,
    f(join(aa,bb),dd) = f(join(cc,bb),dd),
    lhs1 ).

cnf(c_0_23,hypothesis,
    join(meet(f(bb,dd),f(cc,dd)),meet(f(cc,dd),f(aa,dd))) = meet(f(cc,dd),f(aa,dd)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_20]),c_0_14]) ).

cnf(c_0_24,hypothesis,
    join(meet(X1,X2),meet(X2,X3)) = meet(X2,join(X1,X3)),
    inference(spm,[status(thm)],[c_0_21,c_0_11]) ).

cnf(c_0_25,axiom,
    f(join(X1,X2),X3) = join(f(X1,X3),f(X2,X3)),
    f_on_left_join ).

cnf(c_0_26,hypothesis,
    f(join(bb,aa),dd) = f(join(bb,cc),dd),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_14]),c_0_14]) ).

cnf(c_0_27,hypothesis,
    meet(f(cc,dd),f(join(bb,cc),dd)) = meet(f(cc,dd),f(aa,dd)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26]) ).

cnf(c_0_28,plain,
    meet(f(X1,X2),f(join(X3,X1),X2)) = f(X1,X2),
    inference(spm,[status(thm)],[c_0_17,c_0_25]) ).

cnf(c_0_29,hypothesis,
    meet(f(cc,dd),f(aa,dd)) = f(cc,dd),
    inference(rw,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_30,hypothesis,
    meet(f(aa,dd),join(f(cc,dd),X1)) = join(f(cc,dd),meet(f(aa,dd),X1)),
    inference(spm,[status(thm)],[c_0_24,c_0_29]) ).

cnf(c_0_31,hypothesis,
    join(f(cc,dd),meet(f(aa,dd),f(X1,dd))) = meet(f(aa,dd),f(join(cc,X1),dd)),
    inference(spm,[status(thm)],[c_0_30,c_0_25]) ).

cnf(c_0_32,hypothesis,
    join(f(cc,dd),meet(f(X1,dd),f(aa,dd))) = meet(f(aa,dd),f(join(cc,X1),dd)),
    inference(spm,[status(thm)],[c_0_31,c_0_11]) ).

cnf(c_0_33,hypothesis,
    meet(f(aa,dd),f(join(bb,cc),dd)) = f(aa,dd),
    inference(spm,[status(thm)],[c_0_28,c_0_26]) ).

cnf(c_0_34,negated_conjecture,
    f(aa,dd) != f(cc,dd),
    rhs ).

cnf(c_0_35,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_16]),c_0_15]),c_0_14]),c_0_33]),c_0_34]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem    : LAT038-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.06  % 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.06/0.24  % Computer : n012.cluster.edu
% 0.06/0.24  % Model    : x86_64 x86_64
% 0.06/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.24  % Memory   : 8042.1875MB
% 0.06/0.24  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.24  % CPULimit   : 300
% 0.06/0.24  % WCLimit    : 300
% 0.06/0.24  % DateTime   : Mon May  4 20:47:46 EDT 2026
% 0.06/0.24  % CPUTime    : 
% 0.06/0.25  % start to proof: theBenchmark
% 1.68/1.78  % Version  : CSE_E---1.7
% 1.68/1.78  % Problem  : theBenchmark.p
% 1.68/1.78  % SZS status Unsatisfiable for theBenchmark.p
% 1.68/1.78  % SZS output start CNFRefutation
% See solution above
% 1.68/1.79  % Total time : 1.362s
%------------------------------------------------------------------------------