TSTP Solution File: GRP150-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GRP150-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% 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 : 600s
% DateTime : Sat Jul 16 11:45:56 EDT 2022
% Result : Unsatisfiable 0.20s 0.43s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 9 ( 9 unt; 0 nHn; 9 RR)
% Number of literals : 9 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 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(least_upper_bound(a,least_upper_bound(a,b)),least_upper_bound(a,b)),
file('GRP150-1.p',unknown),
[] ).
cnf(5,axiom,
equal(greatest_lower_bound(u,v),greatest_lower_bound(v,u)),
file('GRP150-1.p',unknown),
[] ).
cnf(6,axiom,
equal(least_upper_bound(u,v),least_upper_bound(v,u)),
file('GRP150-1.p',unknown),
[] ).
cnf(11,axiom,
equal(least_upper_bound(u,greatest_lower_bound(u,v)),u),
file('GRP150-1.p',unknown),
[] ).
cnf(12,axiom,
equal(greatest_lower_bound(u,least_upper_bound(u,v)),u),
file('GRP150-1.p',unknown),
[] ).
cnf(36,plain,
equal(least_upper_bound(u,greatest_lower_bound(v,u)),u),
inference(spr,[status(thm),theory(equality)],[5,11]),
[iquote('0:SpR:5.0,11.0')] ).
cnf(56,plain,
equal(least_upper_bound(least_upper_bound(u,v),u),least_upper_bound(u,v)),
inference(spr,[status(thm),theory(equality)],[12,36]),
[iquote('0:SpR:12.0,36.0')] ).
cnf(61,plain,
equal(least_upper_bound(u,least_upper_bound(u,v)),least_upper_bound(u,v)),
inference(rew,[status(thm),theory(equality)],[6,56]),
[iquote('0:Rew:6.0,56.0')] ).
cnf(62,plain,
$false,
inference(unc,[status(thm)],[61,1]),
[iquote('0:UnC:61.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GRP150-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.04/0.14 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 14 06:09:58 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.43
% 0.20/0.43 SPASS V 3.9
% 0.20/0.43 SPASS beiseite: Proof found.
% 0.20/0.43 % SZS status Theorem
% 0.20/0.43 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.43 SPASS derived 42 clauses, backtracked 0 clauses, performed 0 splits and kept 22 clauses.
% 0.20/0.43 SPASS allocated 63130 KBytes.
% 0.20/0.43 SPASS spent 0:00:00.06 on the problem.
% 0.20/0.43 0:00:00.04 for the input.
% 0.20/0.43 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.43 0:00:00.00 for inferences.
% 0.20/0.43 0:00:00.00 for the backtracking.
% 0.20/0.43 0:00:00.00 for the reduction.
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 Here is a proof with depth 2, length 9 :
% 0.20/0.43 % SZS output start Refutation
% See solution above
% 0.20/0.43 Formulae used in the proof : prove_ax_lub2a symmetry_of_glb symmetry_of_lub lub_absorbtion glb_absorbtion
% 0.20/0.43
%------------------------------------------------------------------------------