↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Result   : Unsatisfiable 1.33s 1.75s
% Output   : CNFRefutation 1.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   37 (  37 unt;   0 nHn;   3 RR)
%            Number of literals    :   37 (  36 equ;   2 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    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   78 (  31 sgn)

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

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

cnf(wal_2_2,axiom,
    join(join(meet2(X1,X2),meet2(X3,X2)),X2) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wal_2_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(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(idempotence_of_meet,axiom,
    meet(X1,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/Axioms/LAT005-0.ax',idempotence_of_meet) ).

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

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

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

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

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

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

cnf(c_0_12,axiom,
    join(join(meet2(X1,X2),meet2(X3,X2)),X2) = X2,
    wal_2_2 ).

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

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

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

cnf(c_0_16,axiom,
    meet(X1,X1) = X1,
    idempotence_of_meet ).

cnf(c_0_17,plain,
    join(X1,join(meet2(X2,X1),meet2(X3,X1))) = X1,
    inference(rw,[status(thm)],[c_0_12,c_0_13]) ).

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

cnf(c_0_19,axiom,
    meet2(meet2(join(X1,X2),join(X3,X2)),X2) = X2,
    wal_1_2 ).

cnf(c_0_20,axiom,
    meet2(X1,X2) = meet2(X2,X1),
    commutativity_of_meet2 ).

cnf(c_0_21,plain,
    join(X1,join(meet(X2,X1),meet(X3,X1))) = X1,
    inference(rw,[status(thm)],[c_0_14,c_0_13]) ).

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

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

cnf(c_0_24,plain,
    meet2(X1,meet2(join(X2,X1),join(X3,X1))) = X1,
    inference(rw,[status(thm)],[c_0_19,c_0_20]) ).

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

cnf(c_0_26,plain,
    meet(X1,meet2(X2,X1)) = meet2(X2,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_11]) ).

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

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

cnf(c_0_29,plain,
    meet(X1,meet2(X1,X2)) = meet2(X1,X2),
    inference(spm,[status(thm)],[c_0_26,c_0_20]) ).

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

cnf(c_0_31,plain,
    meet(meet2(X1,X2),meet(X2,join(X3,meet2(X1,X2)))) = meet2(X1,X2),
    inference(spm,[status(thm)],[c_0_15,c_0_23]) ).

cnf(c_0_32,plain,
    join(X1,meet2(X1,X2)) = X1,
    inference(spm,[status(thm)],[c_0_23,c_0_20]) ).

cnf(c_0_33,plain,
    meet(meet2(X1,X2),meet(X2,X1)) = meet(X2,X1),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_34,negated_conjecture,
    meet(a,b) != meet2(a,b),
    name ).

cnf(c_0_35,plain,
    meet(X1,X2) = meet2(X2,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).

cnf(c_0_36,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_20])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : LAT028-1 : TPTP v9.2.1. Released v2.2.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.13/0.33  % Computer : n028.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Mon May  4 20:47:45 EDT 2026
% 0.13/0.33  % CPUTime    : 
% 0.13/0.34  % start to proof: theBenchmark
% 1.33/1.75  % Version  : CSE_E---1.7
% 1.33/1.75  % Problem  : theBenchmark.p
% 1.33/1.75  % SZS status Unsatisfiable for theBenchmark.p
% 1.33/1.75  % SZS output start CNFRefutation
% See solution above
% 1.33/1.75  % Total time : 1.372s
%------------------------------------------------------------------------------