TSTP Solution File: LAT012-1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : LAT012-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n004.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  : 600s
% DateTime : Sun Jul 17 06:48:35 EDT 2022

% Result   : Unsatisfiable 3.60s 3.77s
% Output   : Refutation 3.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   16 (  16 unt;   0 nHn;  16 RR)
%            Number of literals    :   16 (   0 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    equal(join(u,meet(v,meet(u,w))),u),
    file('LAT012-1.p',unknown),
    [] ).

cnf(2,axiom,
    equal(meet(u,join(v,join(u,w))),u),
    file('LAT012-1.p',unknown),
    [] ).

cnf(3,axiom,
    equal(join(join(meet(u,v),meet(v,w)),v),v),
    file('LAT012-1.p',unknown),
    [] ).

cnf(4,axiom,
    equal(meet(meet(join(u,v),join(v,w)),v),v),
    file('LAT012-1.p',unknown),
    [] ).

cnf(5,axiom,
    ~ equal(meet(a,b),meet(b,a)),
    file('LAT012-1.p',unknown),
    [] ).

cnf(7,plain,
    equal(meet(u,join(v,u)),u),
    inference(spr,[status(thm),theory(equality)],[1,2]),
    [iquote('0:SpR:1.0,2.0')] ).

cnf(9,plain,
    equal(join(u,meet(v,u)),u),
    inference(spr,[status(thm),theory(equality)],[2,1]),
    [iquote('0:SpR:2.0,1.0')] ).

cnf(14,plain,
    equal(join(u,meet(u,v)),u),
    inference(spr,[status(thm),theory(equality)],[4,1]),
    [iquote('0:SpR:4.0,1.0')] ).

cnf(27,plain,
    equal(meet(meet(u,join(meet(v,u),w)),meet(v,u)),meet(v,u)),
    inference(spr,[status(thm),theory(equality)],[9,4]),
    [iquote('0:SpR:9.0,4.0')] ).

cnf(48,plain,
    equal(meet(meet(u,v),u),meet(u,v)),
    inference(spr,[status(thm),theory(equality)],[14,7]),
    [iquote('0:SpR:14.0,7.0')] ).

cnf(69,plain,
    equal(join(meet(u,v),v),v),
    inference(spr,[status(thm),theory(equality)],[1,3]),
    [iquote('0:SpR:1.0,3.0')] ).

cnf(201,plain,
    equal(join(meet(u,v),u),u),
    inference(spr,[status(thm),theory(equality)],[48,69]),
    [iquote('0:SpR:48.0,69.0')] ).

cnf(4966,plain,
    equal(meet(meet(u,v),meet(v,u)),meet(v,u)),
    inference(spr,[status(thm),theory(equality)],[201,27]),
    [iquote('0:SpR:201.0,27.0')] ).

cnf(15982,plain,
    equal(meet(meet(u,v),meet(v,u)),meet(u,v)),
    inference(spr,[status(thm),theory(equality)],[4966,48]),
    [iquote('0:SpR:4966.0,48.0')] ).

cnf(16213,plain,
    equal(meet(u,v),meet(v,u)),
    inference(rew,[status(thm),theory(equality)],[4966,15982]),
    [iquote('0:Rew:4966.0,15982.0')] ).

cnf(16214,plain,
    $false,
    inference(unc,[status(thm)],[16213,5]),
    [iquote('0:UnC:16213.0,5.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : LAT012-1 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n004.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Wed Jun 29 13:29:08 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 3.60/3.77  
% 3.60/3.77  SPASS V 3.9 
% 3.60/3.77  SPASS beiseite: Proof found.
% 3.60/3.77  % SZS status Theorem
% 3.60/3.77  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 3.60/3.77  SPASS derived 14304 clauses, backtracked 0 clauses, performed 0 splits and kept 2408 clauses.
% 3.60/3.77  SPASS allocated 74531 KBytes.
% 3.60/3.77  SPASS spent	0:00:03.38 on the problem.
% 3.60/3.77  		0:00:00.03 for the input.
% 3.60/3.77  		0:00:00.00 for the FLOTTER CNF translation.
% 3.60/3.77  		0:00:00.09 for inferences.
% 3.60/3.77  		0:00:00.00 for the backtracking.
% 3.60/3.77  		0:00:03.23 for the reduction.
% 3.60/3.77  
% 3.60/3.77  
% 3.60/3.77  Here is a proof with depth 5, length 16 :
% 3.60/3.77  % SZS output start Refutation
% See solution above
% 3.60/3.77  Formulae used in the proof : mckenzie1 mckenzie2 mckenzie3 mckenzie4 prove_commutativity_of_meet
% 3.60/3.77  
%------------------------------------------------------------------------------