TSTP Solution File: LAT088-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : LAT088-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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:59 EDT 2022
% Result : Unsatisfiable 0.20s 0.46s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 12 RR)
% Number of literals : 12 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(join(meet(u,v),meet(u,join(u,v))),u),
file('LAT088-1.p',unknown),
[] ).
cnf(3,axiom,
equal(join(meet(u,v),meet(v,join(u,v))),v),
file('LAT088-1.p',unknown),
[] ).
cnf(4,axiom,
equal(meet(meet(join(u,v),join(w,u)),u),u),
file('LAT088-1.p',unknown),
[] ).
cnf(5,axiom,
equal(join(join(meet(u,v),meet(w,u)),u),u),
file('LAT088-1.p',unknown),
[] ).
cnf(6,axiom,
~ equal(meet(a,a),a),
file('LAT088-1.p',unknown),
[] ).
cnf(31,plain,
equal(meet(meet(join(u,v),u),u),u),
inference(spr,[status(thm),theory(equality)],[5,4]),
[iquote('0:SpR:5.0,4.0')] ).
cnf(48,plain,
equal(join(u,meet(u,join(meet(join(u,v),u),u))),u),
inference(spr,[status(thm),theory(equality)],[31,3]),
[iquote('0:SpR:31.0,3.0')] ).
cnf(56,plain,
equal(meet(meet(u,meet(u,v)),meet(u,v)),meet(u,v)),
inference(spr,[status(thm),theory(equality)],[1,31]),
[iquote('0:SpR:1.0,31.0')] ).
cnf(81,plain,
equal(meet(meet(u,u),u),u),
inference(spr,[status(thm),theory(equality)],[48,31]),
[iquote('0:SpR:48.0,31.0')] ).
cnf(283,plain,
equal(meet(meet(meet(u,u),u),u),u),
inference(spr,[status(thm),theory(equality)],[81,56]),
[iquote('0:SpR:81.0,56.0')] ).
cnf(297,plain,
equal(meet(u,u),u),
inference(rew,[status(thm),theory(equality)],[81,283]),
[iquote('0:Rew:81.0,283.0')] ).
cnf(298,plain,
$false,
inference(unc,[status(thm)],[297,6]),
[iquote('0:UnC:297.0,6.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LAT088-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Thu Jun 30 00:10:08 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.46
% 0.20/0.46 SPASS V 3.9
% 0.20/0.46 SPASS beiseite: Proof found.
% 0.20/0.46 % SZS status Theorem
% 0.20/0.46 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46 SPASS derived 285 clauses, backtracked 0 clauses, performed 0 splits and kept 149 clauses.
% 0.20/0.46 SPASS allocated 63687 KBytes.
% 0.20/0.46 SPASS spent 0:00:00.10 on the problem.
% 0.20/0.46 0:00:00.03 for the input.
% 0.20/0.46 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.46 0:00:00.00 for inferences.
% 0.20/0.46 0:00:00.00 for the backtracking.
% 0.20/0.46 0:00:00.04 for the reduction.
% 0.20/0.46
% 0.20/0.46
% 0.20/0.46 Here is a proof with depth 4, length 12 :
% 0.20/0.46 % SZS output start Refutation
% See solution above
% 0.20/0.46 Formulae used in the proof : wal_absorbtion_1 wal_absorbtion_3 wal_absorbtion_4 wal_absorbtion_5 prove_normal_axioms_1
% 0.20/0.46
%------------------------------------------------------------------------------