TSTP Solution File: GRP030-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GRP030-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n024.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:44:52 EDT 2022
% Result : Unsatisfiable 0.19s 0.42s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 7 unt; 0 nHn; 15 RR)
% Number of literals : 30 ( 0 equ; 19 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
product(identity,u,u),
file('GRP030-1.p',unknown),
[] ).
cnf(2,axiom,
product(inverse(u),u,identity),
file('GRP030-1.p',unknown),
[] ).
cnf(3,axiom,
~ product(a,identity,a),
file('GRP030-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ product(u,v,w)
| ~ product(x,v,y)
| ~ product(z,x,u)
| product(z,y,w) ),
file('GRP030-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ product(u,v,w)
| ~ product(x,y,v)
| ~ product(u,x,z)
| product(z,y,w) ),
file('GRP030-1.p',unknown),
[] ).
cnf(8,plain,
( ~ product(u,v,a)
| ~ product(w,v,identity)
| ~ product(a,w,u) ),
inference(res,[status(thm),theory(equality)],[6,3]),
[iquote('0:Res:6.3,3.0')] ).
cnf(22,plain,
( ~ product(u,v,w)
| ~ product(inverse(w),u,x)
| product(x,v,identity) ),
inference(res,[status(thm),theory(equality)],[2,7]),
[iquote('0:Res:2.0,7.0')] ).
cnf(36,plain,
( ~ product(u,v,w)
| ~ product(x,u,identity)
| product(x,w,v) ),
inference(res,[status(thm),theory(equality)],[1,6]),
[iquote('0:Res:1.0,6.0')] ).
cnf(60,plain,
( ~ product(u,inverse(v),identity)
| product(u,identity,v) ),
inference(res,[status(thm),theory(equality)],[2,36]),
[iquote('0:Res:2.0,36.0')] ).
cnf(81,plain,
( ~ product(u,a,identity)
| ~ product(a,u,identity) ),
inference(res,[status(thm),theory(equality)],[1,8]),
[iquote('0:Res:1.0,8.0')] ).
cnf(83,plain,
~ product(a,inverse(a),identity),
inference(res,[status(thm),theory(equality)],[2,81]),
[iquote('0:Res:2.0,81.0')] ).
cnf(84,plain,
product(inverse(inverse(u)),identity,u),
inference(res,[status(thm),theory(equality)],[2,60]),
[iquote('0:Res:2.0,60.0')] ).
cnf(142,plain,
( ~ product(identity,u,inverse(v))
| product(v,u,identity) ),
inference(res,[status(thm),theory(equality)],[84,22]),
[iquote('0:Res:84.0,22.1')] ).
cnf(152,plain,
product(u,inverse(u),identity),
inference(res,[status(thm),theory(equality)],[1,142]),
[iquote('0:Res:1.0,142.0')] ).
cnf(153,plain,
$false,
inference(unc,[status(thm)],[152,83]),
[iquote('0:UnC:152.0,83.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP030-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n024.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 : Tue Jun 14 02:14:48 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.42
% 0.19/0.42 SPASS V 3.9
% 0.19/0.42 SPASS beiseite: Proof found.
% 0.19/0.42 % SZS status Theorem
% 0.19/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.42 SPASS derived 129 clauses, backtracked 0 clauses, performed 0 splits and kept 65 clauses.
% 0.19/0.42 SPASS allocated 63205 KBytes.
% 0.19/0.42 SPASS spent 0:00:00.07 on the problem.
% 0.19/0.42 0:00:00.03 for the input.
% 0.19/0.42 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.42 0:00:00.00 for inferences.
% 0.19/0.42 0:00:00.00 for the backtracking.
% 0.19/0.42 0:00:00.01 for the reduction.
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 Here is a proof with depth 5, length 15 :
% 0.19/0.42 % SZS output start Refutation
% See solution above
% 0.19/0.42 Formulae used in the proof : left_identity left_inverse prove_identity_is_a_right_identity associativity1 associativity2
% 0.19/0.42
%------------------------------------------------------------------------------