↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : LAT006-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 : n018.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:18 PM UTC 2026

% Result   : Unsatisfiable 1.64s 1.86s
% Output   : CNFRefutation 1.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   34 (  34 unt;   0 nHn;   4 RR)
%            Number of literals    :   34 (  33 equ;   3 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    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   75 (   9 sgn)

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

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

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

cnf(c_0_3,axiom,
    meet(X1,join(X1,X2)) = X1,
    absorption ).

cnf(c_0_4,axiom,
    meet(X1,join(X2,X3)) = join(meet(X3,X1),meet(X2,X1)),
    distribution ).

cnf(c_0_5,plain,
    meet(meet(X1,X2),meet(X2,join(X3,X1))) = meet(X1,X2),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_6,plain,
    meet(meet(X1,X2),X2) = meet(X1,X2),
    inference(spm,[status(thm)],[c_0_5,c_0_3]) ).

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

cnf(c_0_8,plain,
    meet(X1,join(X2,meet(X3,X1))) = meet(X1,join(X2,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_6]),c_0_4]) ).

cnf(c_0_9,plain,
    meet(X1,meet(X1,join(X2,X3))) = meet(X1,join(X3,X2)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_4]),c_0_8]) ).

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

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

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

cnf(c_0_13,plain,
    join(X1,X1) = X1,
    inference(spm,[status(thm)],[c_0_12,c_0_11]) ).

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

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

cnf(c_0_16,plain,
    join(meet(X1,join(X2,X3)),X2) = meet(join(X2,X3),join(X2,X1)),
    inference(spm,[status(thm)],[c_0_4,c_0_3]) ).

cnf(c_0_17,plain,
    meet(meet(X1,X2),join(X3,X1)) = meet(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_14]),c_0_15]) ).

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

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

cnf(c_0_20,plain,
    meet(X1,meet(meet(X2,X1),X3)) = meet(meet(X2,X1),X3),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_12]),c_0_18]) ).

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

cnf(c_0_22,plain,
    join(meet(X1,X2),meet(X2,join(X3,X1))) = meet(X2,join(X3,X1)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_5]),c_0_19]) ).

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

cnf(c_0_24,plain,
    meet(X1,meet(X2,X3)) = meet(meet(X3,X2),X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_20]),c_0_4]),c_0_4]),c_0_13]) ).

cnf(c_0_25,plain,
    meet(X1,meet(X2,join(X3,X1))) = meet(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).

cnf(c_0_26,plain,
    meet(X1,meet(X2,meet(X1,X3))) = meet(meet(X1,X3),X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_23]),c_0_24]) ).

cnf(c_0_27,plain,
    meet(meet(X1,X2),meet(X3,X2)) = meet(meet(X1,X2),X3),
    inference(spm,[status(thm)],[c_0_25,c_0_12]) ).

cnf(c_0_28,plain,
    meet(X1,meet(X2,X1)) = meet(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_13]),c_0_8]),c_0_13]) ).

cnf(c_0_29,negated_conjecture,
    meet(meet(a,b),c) != meet(a,meet(b,c)),
    prove_associativity_of_meet ).

cnf(c_0_30,plain,
    meet(meet(X1,X2),X3) = meet(X1,meet(X3,X2)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_27]) ).

cnf(c_0_31,negated_conjecture,
    meet(c,meet(a,b)) != meet(a,meet(b,c)),
    inference(rw,[status(thm)],[c_0_29,c_0_18]) ).

cnf(c_0_32,plain,
    meet(X1,meet(X2,X3)) = meet(X3,meet(X1,X2)),
    inference(rw,[status(thm)],[c_0_24,c_0_30]) ).

cnf(c_0_33,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : LAT006-1 : TPTP v9.2.1. Released v2.2.0.
% 0.12/0.13  % 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.34  % Computer : n018.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34  % CPULimit   : 300
% 0.15/0.34  % WCLimit    : 300
% 0.15/0.34  % DateTime   : Mon May  4 20:46:17 EDT 2026
% 0.15/0.34  % CPUTime    : 
% 0.15/0.35  % start to proof: theBenchmark
% 1.64/1.86  % Version  : CSE_E---1.7
% 1.64/1.86  % Problem  : theBenchmark.p
% 1.64/1.86  % SZS status Unsatisfiable for theBenchmark.p
% 1.64/1.86  % SZS output start CNFRefutation
% See solution above
% 1.64/1.87  % Total time : 1.373s
%------------------------------------------------------------------------------