TSTP Solution File: GRP700+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GRP700+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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:49:02 EDT 2022
% Result : Theorem 0.39s 0.57s
% Output : Refutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 16 unt; 0 nHn; 17 RR)
% Number of literals : 18 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 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(mult(u,unit),u),
file('GRP700+1.p',unknown),
[] ).
cnf(2,axiom,
equal(mult(unit,u),u),
file('GRP700+1.p',unknown),
[] ).
cnf(5,axiom,
equal(mult(rd(u,v),v),u),
file('GRP700+1.p',unknown),
[] ).
cnf(6,axiom,
equal(rd(mult(u,v),v),u),
file('GRP700+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ equal(mult(u,skc1),unit)
| ~ equal(mult(skc1,u),unit) ),
file('GRP700+1.p',unknown),
[] ).
cnf(8,axiom,
equal(mult(mult(mult(u,v),u),mult(u,w)),mult(u,mult(mult(mult(v,u),u),w))),
file('GRP700+1.p',unknown),
[] ).
cnf(10,plain,
~ equal(mult(skc1,rd(unit,skc1)),unit),
inference(res,[status(thm),theory(equality)],[5,7]),
[iquote('0:Res:5.0,7.0')] ).
cnf(16,plain,
equal(rd(u,u),unit),
inference(spr,[status(thm),theory(equality)],[2,6]),
[iquote('0:SpR:2.0,6.0')] ).
cnf(68,plain,
equal(mult(u,mult(mult(mult(v,u),u),unit)),mult(mult(mult(u,v),u),u)),
inference(spr,[status(thm),theory(equality)],[1,8]),
[iquote('0:SpR:1.0,8.0')] ).
cnf(77,plain,
equal(mult(mult(mult(u,v),u),u),mult(u,mult(mult(v,u),u))),
inference(rew,[status(thm),theory(equality)],[1,68]),
[iquote('0:Rew:1.0,68.0')] ).
cnf(82,plain,
equal(rd(mult(u,mult(mult(v,u),u)),u),mult(mult(u,v),u)),
inference(spr,[status(thm),theory(equality)],[77,6]),
[iquote('0:SpR:77.0,6.0')] ).
cnf(217,plain,
equal(rd(mult(u,mult(v,u)),u),mult(mult(u,rd(v,u)),u)),
inference(spr,[status(thm),theory(equality)],[5,82]),
[iquote('0:SpR:5.0,82.0')] ).
cnf(577,plain,
equal(mult(mult(u,rd(unit,u)),u),rd(mult(u,u),u)),
inference(spr,[status(thm),theory(equality)],[2,217]),
[iquote('0:SpR:2.0,217.0')] ).
cnf(593,plain,
equal(mult(mult(u,rd(unit,u)),u),u),
inference(rew,[status(thm),theory(equality)],[6,577]),
[iquote('0:Rew:6.0,577.0')] ).
cnf(680,plain,
equal(mult(u,rd(unit,u)),rd(u,u)),
inference(spr,[status(thm),theory(equality)],[593,6]),
[iquote('0:SpR:593.0,6.0')] ).
cnf(699,plain,
equal(mult(u,rd(unit,u)),unit),
inference(rew,[status(thm),theory(equality)],[16,680]),
[iquote('0:Rew:16.0,680.0')] ).
cnf(700,plain,
$false,
inference(unc,[status(thm)],[699,10]),
[iquote('0:UnC:699.0,10.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP700+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 03:59:48 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.39/0.57
% 0.39/0.57 SPASS V 3.9
% 0.39/0.57 SPASS beiseite: Proof found.
% 0.39/0.57 % SZS status Theorem
% 0.39/0.57 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.39/0.57 SPASS derived 445 clauses, backtracked 0 clauses, performed 0 splits and kept 212 clauses.
% 0.39/0.57 SPASS allocated 86546 KBytes.
% 0.39/0.57 SPASS spent 0:00:00.21 on the problem.
% 0.39/0.57 0:00:00.03 for the input.
% 0.39/0.57 0:00:00.02 for the FLOTTER CNF translation.
% 0.39/0.57 0:00:00.01 for inferences.
% 0.39/0.57 0:00:00.00 for the backtracking.
% 0.39/0.57 0:00:00.13 for the reduction.
% 0.39/0.57
% 0.39/0.57
% 0.39/0.57 Here is a proof with depth 5, length 17 :
% 0.39/0.57 % SZS output start Refutation
% See solution above
% 0.39/0.57 Formulae used in the proof : f05 f06 f03 f04 goals f07
% 0.39/0.57
%------------------------------------------------------------------------------