TSTP Solution File: GRP461-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GRP461-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n021.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:47:35 EDT 2022
% Result : Unsatisfiable 0.20s 0.41s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 20 RR)
% Number of literals : 20 ( 0 equ; 2 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 : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(divide(u,divide(divide(divide(identity,v),w),divide(divide(divide(u,u),u),w))),v),
file('GRP461-1.p',unknown),
[] ).
cnf(2,axiom,
equal(divide(u,divide(identity,v)),multiply(u,v)),
file('GRP461-1.p',unknown),
[] ).
cnf(3,axiom,
equal(divide(identity,u),inverse(u)),
file('GRP461-1.p',unknown),
[] ).
cnf(4,axiom,
equal(divide(u,u),identity),
file('GRP461-1.p',unknown),
[] ).
cnf(5,axiom,
~ equal(multiply(identity,a2),a2),
file('GRP461-1.p',unknown),
[] ).
cnf(6,plain,
equal(divide(u,inverse(v)),multiply(u,v)),
inference(rew,[status(thm),theory(equality)],[3,2]),
[iquote('0:Rew:3.0,2.0')] ).
cnf(7,plain,
equal(divide(u,divide(divide(inverse(v),w),divide(inverse(u),w))),v),
inference(rew,[status(thm),theory(equality)],[3,1,4]),
[iquote('0:Rew:3.0,1.0,3.0,1.0,4.0,1.0')] ).
cnf(9,plain,
equal(inverse(identity),identity),
inference(spr,[status(thm),theory(equality)],[3,4]),
[iquote('0:SpR:3.0,4.0')] ).
cnf(13,plain,
equal(multiply(identity,u),inverse(inverse(u))),
inference(spr,[status(thm),theory(equality)],[6,3]),
[iquote('0:SpR:6.0,3.0')] ).
cnf(15,plain,
equal(divide(u,identity),multiply(u,identity)),
inference(spr,[status(thm),theory(equality)],[9,6]),
[iquote('0:SpR:9.0,6.0')] ).
cnf(16,plain,
~ equal(inverse(inverse(a2)),a2),
inference(rew,[status(thm),theory(equality)],[13,5]),
[iquote('0:Rew:13.0,5.0')] ).
cnf(32,plain,
equal(divide(u,divide(divide(inverse(v),inverse(u)),identity)),v),
inference(spr,[status(thm),theory(equality)],[4,7]),
[iquote('0:SpR:4.0,7.0')] ).
cnf(39,plain,
equal(divide(u,identity),u),
inference(spr,[status(thm),theory(equality)],[4,7]),
[iquote('0:SpR:4.0,7.0')] ).
cnf(40,plain,
equal(multiply(u,identity),u),
inference(rew,[status(thm),theory(equality)],[15,39]),
[iquote('0:Rew:15.0,39.0')] ).
cnf(41,plain,
equal(divide(u,identity),u),
inference(rew,[status(thm),theory(equality)],[40,15]),
[iquote('0:Rew:40.0,15.0')] ).
cnf(42,plain,
equal(divide(u,divide(multiply(inverse(v),u),identity)),v),
inference(rew,[status(thm),theory(equality)],[6,32]),
[iquote('0:Rew:6.0,32.0')] ).
cnf(43,plain,
equal(divide(u,multiply(inverse(v),u)),v),
inference(rew,[status(thm),theory(equality)],[41,42]),
[iquote('0:Rew:41.0,42.0')] ).
cnf(70,plain,
equal(divide(identity,inverse(u)),u),
inference(spr,[status(thm),theory(equality)],[40,43]),
[iquote('0:SpR:40.0,43.0')] ).
cnf(72,plain,
equal(inverse(inverse(u)),u),
inference(rew,[status(thm),theory(equality)],[13,70,6]),
[iquote('0:Rew:13.0,70.0,6.0,70.0')] ).
cnf(73,plain,
$false,
inference(unc,[status(thm)],[72,16]),
[iquote('0:UnC:72.0,16.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP461-1 : TPTP v8.1.0. Released v2.6.0.
% 0.12/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 09:18:12 EDT 2022
% 0.20/0.34 % CPUTime :
% 0.20/0.41
% 0.20/0.41 SPASS V 3.9
% 0.20/0.41 SPASS beiseite: Proof found.
% 0.20/0.41 % SZS status Theorem
% 0.20/0.41 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.41 SPASS derived 44 clauses, backtracked 0 clauses, performed 0 splits and kept 24 clauses.
% 0.20/0.41 SPASS allocated 63177 KBytes.
% 0.20/0.41 SPASS spent 0:00:00.06 on the problem.
% 0.20/0.41 0:00:00.03 for the input.
% 0.20/0.41 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.41 0:00:00.00 for inferences.
% 0.20/0.41 0:00:00.00 for the backtracking.
% 0.20/0.41 0:00:00.00 for the reduction.
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Here is a proof with depth 2, length 20 :
% 0.20/0.41 % SZS output start Refutation
% See solution above
% 0.20/0.41 Formulae used in the proof : single_axiom multiply inverse identity prove_these_axioms_2
% 0.20/0.41
%------------------------------------------------------------------------------