TSTP Solution File: GRP699-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GRP699-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:49:01 EDT 2022
% Result : Unsatisfiable 0.81s 0.99s
% Output : Refutation 0.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 13 RR)
% Number of literals : 13 ( 0 equ; 1 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 : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(mult(u,ld(u,v)),v),
file('GRP699-1.p',unknown),
[] ).
cnf(2,axiom,
equal(ld(u,mult(u,v)),v),
file('GRP699-1.p',unknown),
[] ).
cnf(6,axiom,
equal(mult(unit,u),u),
file('GRP699-1.p',unknown),
[] ).
cnf(8,axiom,
equal(mult(mult(u,mult(v,mult(v,w))),v),mult(mult(u,v),mult(v,mult(w,v)))),
file('GRP699-1.p',unknown),
[] ).
cnf(9,axiom,
~ equal(mult(mult(a,c),ld(c,mult(b,c))),mult(mult(a,b),c)),
file('GRP699-1.p',unknown),
[] ).
cnf(84,plain,
equal(mult(mult(u,v),mult(v,mult(ld(v,w),v))),mult(mult(u,mult(v,w)),v)),
inference(spr,[status(thm),theory(equality)],[1,8]),
[iquote('0:SpR:1.0,8.0')] ).
cnf(88,plain,
equal(mult(mult(unit,u),mult(u,mult(v,u))),mult(mult(u,mult(u,v)),u)),
inference(spr,[status(thm),theory(equality)],[6,8]),
[iquote('0:SpR:6.0,8.0')] ).
cnf(95,plain,
equal(mult(mult(u,mult(u,v)),u),mult(u,mult(u,mult(v,u)))),
inference(rew,[status(thm),theory(equality)],[6,88]),
[iquote('0:Rew:6.0,88.0')] ).
cnf(255,plain,
equal(mult(u,mult(u,mult(ld(u,v),u))),mult(mult(u,v),u)),
inference(spr,[status(thm),theory(equality)],[1,95]),
[iquote('0:SpR:1.0,95.0')] ).
cnf(993,plain,
equal(mult(u,mult(ld(u,v),u)),ld(u,mult(mult(u,v),u))),
inference(spr,[status(thm),theory(equality)],[255,2]),
[iquote('0:SpR:255.0,2.0')] ).
cnf(1029,plain,
equal(mult(mult(u,v),ld(v,mult(mult(v,w),v))),mult(mult(u,mult(v,w)),v)),
inference(rew,[status(thm),theory(equality)],[993,84]),
[iquote('0:Rew:993.0,84.0')] ).
cnf(2419,plain,
equal(mult(mult(u,v),ld(v,mult(w,v))),mult(mult(u,w),v)),
inference(spr,[status(thm),theory(equality)],[1,1029]),
[iquote('0:SpR:1.0,1029.0')] ).
cnf(2456,plain,
$false,
inference(unc,[status(thm)],[2419,9]),
[iquote('0:UnC:2419.0,9.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP699-1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n017.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 14 09:05:23 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.81/0.99
% 0.81/0.99 SPASS V 3.9
% 0.81/0.99 SPASS beiseite: Proof found.
% 0.81/0.99 % SZS status Theorem
% 0.81/0.99 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.81/0.99 SPASS derived 1418 clauses, backtracked 0 clauses, performed 0 splits and kept 554 clauses.
% 0.81/0.99 SPASS allocated 68493 KBytes.
% 0.81/0.99 SPASS spent 0:00:00.63 on the problem.
% 0.81/0.99 0:00:00.04 for the input.
% 0.81/0.99 0:00:00.00 for the FLOTTER CNF translation.
% 0.81/0.99 0:00:00.02 for inferences.
% 0.81/0.99 0:00:00.00 for the backtracking.
% 0.81/0.99 0:00:00.55 for the reduction.
% 0.81/0.99
% 0.81/0.99
% 0.81/0.99 Here is a proof with depth 3, length 13 :
% 0.81/0.99 % SZS output start Refutation
% See solution above
% 0.81/0.99 Formulae used in the proof : c01 c02 c06 c08 goals
% 0.81/0.99
%------------------------------------------------------------------------------