↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.67s 1.78s
% Output   : CNFRefutation 1.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   32 (  32 unt;   0 nHn;   4 RR)
%            Number of literals    :   32 (  31 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   75 (  20 sgn)

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

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

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

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

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

cnf(c_0_5,axiom,
    join(join(meet(X1,X2),meet(X3,X2)),X2) = X2,
    wal_2 ).

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

cnf(c_0_7,plain,
    join(X1,join(meet(X2,X1),meet(X3,X1))) = X1,
    inference(rw,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,hypothesis,
    meet(X1,join(X2,join(X1,X3))) = X1,
    absorption ).

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

cnf(c_0_10,hypothesis,
    join(join(X1,join(X2,X3)),join(X2,meet(X4,join(X1,join(X2,X3))))) = join(X1,join(X2,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_6]) ).

cnf(c_0_11,hypothesis,
    meet(X1,join(X1,X2)) = X1,
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,plain,
    join(X1,meet(X2,X1)) = X1,
    inference(spm,[status(thm)],[c_0_7,c_0_9]) ).

cnf(c_0_13,hypothesis,
    join(join(X1,X2),join(X2,join(X1,X3))) = join(X2,join(X1,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_6]) ).

cnf(c_0_14,hypothesis,
    join(X1,join(X2,join(X1,X3))) = join(X2,join(X1,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_8]),c_0_6]) ).

cnf(c_0_15,hypothesis,
    meet(X1,join(X2,X1)) = X1,
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_16,hypothesis,
    meet(X1,join(X2,join(X3,X1))) = X1,
    inference(spm,[status(thm)],[c_0_8,c_0_6]) ).

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

cnf(c_0_18,hypothesis,
    join(join(X1,X2),join(X2,meet(X3,join(X1,X2)))) = join(X1,X2),
    inference(spm,[status(thm)],[c_0_7,c_0_15]) ).

cnf(c_0_19,hypothesis,
    meet(X1,join(join(X2,X1),X3)) = X1,
    inference(spm,[status(thm)],[c_0_16,c_0_6]) ).

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

cnf(c_0_21,hypothesis,
    join(X1,join(X2,join(X3,X1))) = join(X2,join(X3,X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_16]),c_0_6]) ).

cnf(c_0_22,hypothesis,
    join(join(X1,X2),join(X2,X1)) = join(X1,X2),
    inference(spm,[status(thm)],[c_0_18,c_0_11]) ).

cnf(c_0_23,hypothesis,
    join(join(X1,X2),join(join(X3,X2),X1)) = join(join(X3,X2),X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_6]) ).

cnf(c_0_24,hypothesis,
    join(join(X1,X2),join(X3,X1)) = join(X3,join(X1,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_20]),c_0_13]) ).

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

cnf(c_0_26,hypothesis,
    join(join(X1,X2),join(X3,X2)) = join(join(X1,X2),X3),
    inference(rw,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_27,negated_conjecture,
    join(join(a,b),c) != join(a,join(b,c)),
    prove_associativity_of_join ).

cnf(c_0_28,hypothesis,
    join(join(X1,X2),X3) = join(X1,join(X2,X3)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_26]),c_0_24]) ).

cnf(c_0_29,negated_conjecture,
    join(c,join(a,b)) != join(a,join(b,c)),
    inference(rw,[status(thm)],[c_0_27,c_0_6]) ).

cnf(c_0_30,hypothesis,
    join(X1,join(X2,X3)) = join(X2,join(X3,X1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_28]),c_0_21]) ).

cnf(c_0_31,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_6]),c_0_30]),c_0_6])]),
    [proof] ).

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