%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GRP748+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n018.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:15 EDT 2022
% Result : Theorem 0.49s 0.66s
% Output : Refutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of clauses : 31 ( 23 unt; 8 nHn; 31 RR)
% Number of literals : 39 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
equal(mult(unit,u),u),
file('GRP748+1.p',unknown),
[] ).
cnf(3,axiom,
equal(mult(u,i(u)),unit),
file('GRP748+1.p',unknown),
[] ).
cnf(4,axiom,
equal(mult(i(u),u),unit),
file('GRP748+1.p',unknown),
[] ).
cnf(5,axiom,
equal(mult(u,ld(u,v)),v),
file('GRP748+1.p',unknown),
[] ).
cnf(6,axiom,
equal(ld(u,mult(u,v)),v),
file('GRP748+1.p',unknown),
[] ).
cnf(7,axiom,
equal(mult(rd(u,v),v),u),
file('GRP748+1.p',unknown),
[] ).
cnf(8,axiom,
equal(rd(mult(u,v),v),u),
file('GRP748+1.p',unknown),
[] ).
cnf(9,axiom,
equal(mult(mult(u,v),i(v)),u),
file('GRP748+1.p',unknown),
[] ).
cnf(10,axiom,
equal(mult(mult(mult(u,v),w),v),mult(u,mult(mult(v,w),v))),
file('GRP748+1.p',unknown),
[] ).
cnf(11,axiom,
( equal(mult(u,v),mult(v,u))
| equal(mult(i(u),mult(u,v)),v) ),
file('GRP748+1.p',unknown),
[] ).
cnf(13,axiom,
~ equal(mult(mult(mult(skc17,skc15),skc16),skc15),mult(skc17,mult(skc15,mult(skc16,skc15)))),
file('GRP748+1.p',unknown),
[] ).
cnf(16,plain,
~ equal(mult(skc17,mult(mult(skc15,skc16),skc15)),mult(skc17,mult(skc15,mult(skc16,skc15)))),
inference(rew,[status(thm),theory(equality)],[10,13]),
[iquote('0:Rew:10.0,13.0')] ).
cnf(29,plain,
equal(rd(unit,u),i(u)),
inference(spr,[status(thm),theory(equality)],[4,8]),
[iquote('0:SpR:4.0,8.0')] ).
cnf(31,plain,
equal(rd(unit,i(u)),u),
inference(spr,[status(thm),theory(equality)],[3,8]),
[iquote('0:SpR:3.0,8.0')] ).
cnf(32,plain,
equal(i(i(u)),u),
inference(rew,[status(thm),theory(equality)],[29,31]),
[iquote('0:Rew:29.0,31.0')] ).
cnf(105,plain,
equal(mult(u,i(v)),rd(u,v)),
inference(spr,[status(thm),theory(equality)],[7,9]),
[iquote('0:SpR:7.0,9.0')] ).
cnf(115,plain,
( equal(mult(u,v),mult(v,u))
| equal(ld(i(u),v),mult(u,v)) ),
inference(spr,[status(thm),theory(equality)],[11,6]),
[iquote('0:SpR:11.1,6.0')] ).
cnf(121,plain,
( equal(mult(ld(u,v),u),mult(u,ld(u,v)))
| equal(mult(i(u),v),ld(u,v)) ),
inference(spr,[status(thm),theory(equality)],[5,11]),
[iquote('0:SpR:5.0,11.1')] ).
cnf(129,plain,
( equal(mult(ld(u,v),u),v)
| equal(mult(i(u),v),ld(u,v)) ),
inference(rew,[status(thm),theory(equality)],[5,121]),
[iquote('0:Rew:5.0,121.0')] ).
cnf(199,plain,
equal(mult(i(u),mult(mult(u,v),u)),mult(mult(unit,v),u)),
inference(spr,[status(thm),theory(equality)],[4,10]),
[iquote('0:SpR:4.0,10.0')] ).
cnf(211,plain,
equal(mult(i(u),mult(mult(u,v),u)),mult(v,u)),
inference(rew,[status(thm),theory(equality)],[2,199]),
[iquote('0:Rew:2.0,199.0')] ).
cnf(883,plain,
equal(ld(i(u),mult(v,u)),mult(mult(u,v),u)),
inference(spr,[status(thm),theory(equality)],[211,6]),
[iquote('0:SpR:211.0,6.0')] ).
cnf(1600,plain,
( equal(mult(i(u),v),mult(v,i(u)))
| equal(mult(i(u),v),ld(u,v)) ),
inference(spr,[status(thm),theory(equality)],[32,115]),
[iquote('0:SpR:32.0,115.1')] ).
cnf(1608,plain,
( equal(mult(i(u),v),rd(v,u))
| equal(mult(i(u),v),ld(u,v)) ),
inference(rew,[status(thm),theory(equality)],[105,1600]),
[iquote('0:Rew:105.0,1600.0')] ).
cnf(1883,plain,
( equal(mult(i(u),v),ld(u,v))
| equal(rd(v,u),ld(u,v)) ),
inference(spr,[status(thm),theory(equality)],[129,8]),
[iquote('0:SpR:129.0,8.0')] ).
cnf(1920,plain,
( equal(mult(i(u),v),ld(u,v))
| equal(mult(i(u),v),ld(u,v)) ),
inference(rew,[status(thm),theory(equality)],[1883,1608]),
[iquote('0:Rew:1883.1,1608.0')] ).
cnf(1921,plain,
equal(mult(i(u),v),ld(u,v)),
inference(obv,[status(thm),theory(equality)],[1920]),
[iquote('0:Obv:1920.0')] ).
cnf(2064,plain,
equal(ld(i(u),v),mult(u,v)),
inference(spr,[status(thm),theory(equality)],[32,1921]),
[iquote('0:SpR:32.0,1921.0')] ).
cnf(2067,plain,
equal(mult(mult(u,v),u),mult(u,mult(v,u))),
inference(rew,[status(thm),theory(equality)],[2064,883]),
[iquote('0:Rew:2064.0,883.0')] ).
cnf(2136,plain,
~ equal(mult(skc17,mult(skc15,mult(skc16,skc15))),mult(skc17,mult(skc15,mult(skc16,skc15)))),
inference(rew,[status(thm),theory(equality)],[2067,16]),
[iquote('0:Rew:2067.0,16.0')] ).
cnf(2228,plain,
$false,
inference(obv,[status(thm),theory(equality)],[2136]),
[iquote('0:Obv:2136.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP748+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n018.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 : Mon Jun 13 21:42:28 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.49/0.66
% 0.49/0.66 SPASS V 3.9
% 0.49/0.66 SPASS beiseite: Proof found.
% 0.49/0.66 % SZS status Theorem
% 0.49/0.66 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.49/0.66 SPASS derived 1353 clauses, backtracked 0 clauses, performed 0 splits and kept 443 clauses.
% 0.49/0.66 SPASS allocated 87664 KBytes.
% 0.49/0.66 SPASS spent 0:00:00.31 on the problem.
% 0.49/0.66 0:00:00.03 for the input.
% 0.49/0.66 0:00:00.02 for the FLOTTER CNF translation.
% 0.49/0.66 0:00:00.01 for inferences.
% 0.49/0.66 0:00:00.00 for the backtracking.
% 0.49/0.66 0:00:00.21 for the reduction.
% 0.49/0.66
% 0.49/0.66
% 0.49/0.66 Here is a proof with depth 3, length 31 :
% 0.49/0.66 % SZS output start Refutation
% See solution above
% 0.49/0.66 Formulae used in the proof : f06 f09 f10 f01 f02 f03 f04 f08 f07 f11 goals
% 0.49/0.66
%------------------------------------------------------------------------------