TSTP Solution File: GRP519-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GRP519-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n016.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:51 EDT 2022
% Result : Unsatisfiable 0.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 14 RR)
% Number of literals : 14 ( 0 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(multiply(u,multiply(multiply(inverse(multiply(u,v)),w),v)),w),
file('GRP519-1.p',unknown),
[] ).
cnf(2,axiom,
~ equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))),
file('GRP519-1.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(u,multiply(multiply(inverse(v),w),multiply(multiply(inverse(multiply(u,x)),v),x))),w),
inference(spr,[status(thm),theory(equality)],[1]),
[iquote('0:SpR:1.0,1.0')] ).
cnf(4,plain,
equal(multiply(multiply(inverse(multiply(inverse(multiply(u,v)),w)),x),w),multiply(u,multiply(x,v))),
inference(spr,[status(thm),theory(equality)],[1]),
[iquote('0:SpR:1.0,1.0')] ).
cnf(15,plain,
equal(multiply(multiply(inverse(u),v),u),v),
inference(spr,[status(thm),theory(equality)],[1,3]),
[iquote('0:SpR:1.0,3.0')] ).
cnf(22,plain,
equal(multiply(multiply(inverse(multiply(inverse(u),v)),w),v),multiply(w,u)),
inference(spr,[status(thm),theory(equality)],[1,15]),
[iquote('0:SpR:1.0,15.0')] ).
cnf(23,plain,
equal(multiply(multiply(inverse(u),v),multiply(multiply(inverse(multiply(inverse(w),x)),u),x)),multiply(v,w)),
inference(spr,[status(thm),theory(equality)],[3,15]),
[iquote('0:SpR:3.0,15.0')] ).
cnf(26,plain,
equal(multiply(u,multiply(v,w)),multiply(v,multiply(u,w))),
inference(rew,[status(thm),theory(equality)],[22,4]),
[iquote('0:Rew:22.0,4.0')] ).
cnf(28,plain,
equal(multiply(u,multiply(multiply(inverse(u),v),w)),multiply(v,w)),
inference(rew,[status(thm),theory(equality)],[26,23,22]),
[iquote('0:Rew:26.0,23.0,22.0,23.0')] ).
cnf(70,plain,
equal(multiply(u,v),multiply(v,u)),
inference(spr,[status(thm),theory(equality)],[15,28]),
[iquote('0:SpR:15.0,28.0')] ).
cnf(74,plain,
~ equal(multiply(c3,multiply(a3,b3)),multiply(a3,multiply(b3,c3))),
inference(rew,[status(thm),theory(equality)],[70,2]),
[iquote('0:Rew:70.0,2.0')] ).
cnf(83,plain,
~ equal(multiply(a3,multiply(c3,b3)),multiply(a3,multiply(b3,c3))),
inference(rew,[status(thm),theory(equality)],[26,74]),
[iquote('0:Rew:26.0,74.0')] ).
cnf(84,plain,
~ equal(multiply(a3,multiply(b3,c3)),multiply(a3,multiply(b3,c3))),
inference(rew,[status(thm),theory(equality)],[70,83]),
[iquote('0:Rew:70.0,83.0')] ).
cnf(85,plain,
$false,
inference(obv,[status(thm),theory(equality)],[84]),
[iquote('0:Obv:84.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP519-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n016.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 06:10:44 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.44
% 0.20/0.44 SPASS V 3.9
% 0.20/0.44 SPASS beiseite: Proof found.
% 0.20/0.44 % SZS status Theorem
% 0.20/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.44 SPASS derived 80 clauses, backtracked 0 clauses, performed 0 splits and kept 45 clauses.
% 0.20/0.44 SPASS allocated 63281 KBytes.
% 0.20/0.44 SPASS spent 0:00:00.08 on the problem.
% 0.20/0.44 0:00:00.04 for the input.
% 0.20/0.44 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.44 0:00:00.00 for inferences.
% 0.20/0.44 0:00:00.00 for the backtracking.
% 0.20/0.44 0:00:00.02 for the reduction.
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Here is a proof with depth 4, length 14 :
% 0.20/0.44 % SZS output start Refutation
% See solution above
% 0.20/0.44 Formulae used in the proof : single_axiom prove_these_axioms_3
% 0.20/0.44
%------------------------------------------------------------------------------