TSTP Solution File: LAT014-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LAT014-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n011.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 0.18s 0.40s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 11 RR)
% Number of literals : 11 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 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('LAT014-1.p',unknown),
[] ).
cnf(2,axiom,
equal(meet(u,join(v,join(u,w))),u),
file('LAT014-1.p',unknown),
[] ).
cnf(4,axiom,
equal(meet(meet(join(u,v),join(v,w)),v),v),
file('LAT014-1.p',unknown),
[] ).
cnf(5,axiom,
~ equal(meet(a,join(a,b)),a),
file('LAT014-1.p',unknown),
[] ).
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(16,plain,
equal(meet(meet(join(u,v),v),v),v),
inference(spr,[status(thm),theory(equality)],[1,4]),
[iquote('0:SpR:1.0,4.0')] ).
cnf(18,plain,
equal(meet(join(u,v),v),v),
inference(spr,[status(thm),theory(equality)],[2,4]),
[iquote('0:SpR:2.0,4.0')] ).
cnf(20,plain,
equal(meet(u,u),u),
inference(rew,[status(thm),theory(equality)],[18,16]),
[iquote('0:Rew:18.0,16.0')] ).
cnf(32,plain,
equal(join(u,u),u),
inference(spr,[status(thm),theory(equality)],[20,9]),
[iquote('0:SpR:20.0,9.0')] ).
cnf(38,plain,
equal(meet(u,join(u,v)),u),
inference(spr,[status(thm),theory(equality)],[32,2]),
[iquote('0:SpR:32.0,2.0')] ).
cnf(41,plain,
$false,
inference(unc,[status(thm)],[38,5]),
[iquote('0:UnC:38.0,5.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LAT014-1 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n011.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 15:33:32 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.40
% 0.18/0.40 SPASS V 3.9
% 0.18/0.40 SPASS beiseite: Proof found.
% 0.18/0.40 % SZS status Theorem
% 0.18/0.40 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.40 SPASS derived 33 clauses, backtracked 0 clauses, performed 0 splits and kept 20 clauses.
% 0.18/0.40 SPASS allocated 63125 KBytes.
% 0.18/0.40 SPASS spent 0:00:00.06 on the problem.
% 0.18/0.40 0:00:00.04 for the input.
% 0.18/0.40 0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.40 0:00:00.00 for inferences.
% 0.18/0.40 0:00:00.00 for the backtracking.
% 0.18/0.40 0:00:00.00 for the reduction.
% 0.18/0.40
% 0.18/0.40
% 0.18/0.40 Here is a proof with depth 3, length 11 :
% 0.18/0.40 % SZS output start Refutation
% See solution above
% 0.18/0.40 Formulae used in the proof : mckenzie1 mckenzie2 mckenzie4 prove_absorbtion
% 0.18/0.40
%------------------------------------------------------------------------------