TSTP Solution File: GRP021-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GRP021-1 : TPTP v8.1.0. Released v1.0.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:44:48 EDT 2022
% Result : Unsatisfiable 0.20s 0.42s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 10 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ equal(multiply(a,inverse(a)),identity),
file('GRP021-1.p',unknown),
[] ).
cnf(5,axiom,
product(u,inverse(u),identity),
file('GRP021-1.p',unknown),
[] ).
cnf(6,axiom,
product(u,v,multiply(u,v)),
file('GRP021-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ product(u,v,w)
| ~ product(u,v,x)
| equal(x,w) ),
file('GRP021-1.p',unknown),
[] ).
cnf(10,plain,
( ~ product(u,v,identity)
| ~ product(u,v,multiply(a,inverse(a))) ),
inference(res,[status(thm),theory(equality)],[7,1]),
[iquote('0:Res:7.2,1.0')] ).
cnf(14,plain,
~ product(a,inverse(a),identity),
inference(res,[status(thm),theory(equality)],[6,10]),
[iquote('0:Res:6.0,10.1')] ).
cnf(15,plain,
$false,
inference(mrr,[status(thm)],[14,5]),
[iquote('0:MRR:14.0,5.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP021-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.14 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jun 13 13:50:59 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.20/0.42
% 0.20/0.42 SPASS V 3.9
% 0.20/0.42 SPASS beiseite: Proof found.
% 0.20/0.42 % SZS status Theorem
% 0.20/0.42 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.42 SPASS derived 5 clauses, backtracked 0 clauses, performed 0 splits and kept 13 clauses.
% 0.20/0.42 SPASS allocated 63091 KBytes.
% 0.20/0.42 SPASS spent 0:00:00.06 on the problem.
% 0.20/0.42 0:00:00.03 for the input.
% 0.20/0.42 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.42 0:00:00.00 for inferences.
% 0.20/0.42 0:00:00.00 for the backtracking.
% 0.20/0.42 0:00:00.00 for the reduction.
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Here is a proof with depth 2, length 7 :
% 0.20/0.42 % SZS output start Refutation
% See solution above
% 0.20/0.42 Formulae used in the proof : prove_X_times_inverse_X_is_id right_inverse total_function1 total_function2
% 0.20/0.42
%------------------------------------------------------------------------------