TSTP Solution File: GRP679-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GRP679-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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:48:56 EDT 2022
% Result : Unsatisfiable 0.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 13 RR)
% Number of literals : 13 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
equal(ld(u,mult(u,v)),v),
file('GRP679-1.p',unknown),
[] ).
cnf(6,axiom,
equal(mult(unit,u),u),
file('GRP679-1.p',unknown),
[] ).
cnf(7,axiom,
equal(mult(mult(u,mult(v,u)),w),mult(u,mult(v,mult(u,w)))),
file('GRP679-1.p',unknown),
[] ).
cnf(8,axiom,
equal(mult(op_c,u),mult(u,op_c)),
file('GRP679-1.p',unknown),
[] ).
cnf(9,axiom,
~ equal(mult(mult(op_c,op_c),a),mult(a,mult(op_c,op_c))),
file('GRP679-1.p',unknown),
[] ).
cnf(51,plain,
equal(ld(op_c,mult(u,op_c)),u),
inference(spr,[status(thm),theory(equality)],[8,2]),
[iquote('0:SpR:8.0,2.0')] ).
cnf(136,plain,
equal(mult(u,mult(unit,mult(u,v))),mult(mult(u,u),v)),
inference(spr,[status(thm),theory(equality)],[6,7]),
[iquote('0:SpR:6.0,7.0')] ).
cnf(139,plain,
equal(mult(mult(op_c,mult(op_c,u)),v),mult(op_c,mult(u,mult(op_c,v)))),
inference(spr,[status(thm),theory(equality)],[8,7]),
[iquote('0:SpR:8.0,7.0')] ).
cnf(144,plain,
equal(mult(mult(u,u),v),mult(u,mult(u,v))),
inference(rew,[status(thm),theory(equality)],[6,136]),
[iquote('0:Rew:6.0,136.0')] ).
cnf(145,plain,
~ equal(mult(a,mult(op_c,op_c)),mult(op_c,mult(op_c,a))),
inference(rew,[status(thm),theory(equality)],[144,9]),
[iquote('0:Rew:144.0,9.0')] ).
cnf(316,plain,
equal(ld(op_c,mult(op_c,mult(u,mult(op_c,op_c)))),mult(op_c,mult(op_c,u))),
inference(spr,[status(thm),theory(equality)],[139,51]),
[iquote('0:SpR:139.0,51.0')] ).
cnf(344,plain,
equal(mult(u,mult(op_c,op_c)),mult(op_c,mult(op_c,u))),
inference(rew,[status(thm),theory(equality)],[2,316]),
[iquote('0:Rew:2.0,316.0')] ).
cnf(345,plain,
$false,
inference(unc,[status(thm)],[344,145]),
[iquote('0:UnC:344.0,145.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP679-1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.14/0.32 % Computer : n017.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Mon Jun 13 21:10:38 EDT 2022
% 0.14/0.33 % CPUTime :
% 0.19/0.44
% 0.19/0.44 SPASS V 3.9
% 0.19/0.44 SPASS beiseite: Proof found.
% 0.19/0.44 % SZS status Theorem
% 0.19/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44 SPASS derived 277 clauses, backtracked 0 clauses, performed 0 splits and kept 81 clauses.
% 0.19/0.44 SPASS allocated 63561 KBytes.
% 0.19/0.44 SPASS spent 0:00:00.10 on the problem.
% 0.19/0.44 0:00:00.04 for the input.
% 0.19/0.44 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.44 0:00:00.00 for inferences.
% 0.19/0.44 0:00:00.00 for the backtracking.
% 0.19/0.44 0:00:00.03 for the reduction.
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Here is a proof with depth 2, length 13 :
% 0.19/0.44 % SZS output start Refutation
% See solution above
% 0.19/0.44 Formulae used in the proof : c02 c06 c07 c08 goals
% 0.19/0.44
%------------------------------------------------------------------------------