TSTP Solution File: GRP704+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GRP704+1 : TPTP v8.1.0. Released v4.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:49:05 EDT 2022
% Result : Theorem 0.21s 0.47s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 21 ( 15 unt; 0 nHn; 21 RR)
% Number of literals : 30 ( 0 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 12 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
equal(mult(unit,u),u),
file('GRP704+1.p',unknown),
[] ).
cnf(3,axiom,
equal(mult(u,ld(u,v)),v),
file('GRP704+1.p',unknown),
[] ).
cnf(4,axiom,
equal(ld(u,mult(u,v)),v),
file('GRP704+1.p',unknown),
[] ).
cnf(7,axiom,
equal(ld(u,mult(op_c,u)),op_d),
file('GRP704+1.p',unknown),
[] ).
cnf(8,axiom,
equal(mult(mult(op_c,u),v),mult(op_c,mult(u,v))),
file('GRP704+1.p',unknown),
[] ).
cnf(9,axiom,
equal(mult(mult(u,v),op_c),mult(u,mult(v,op_c))),
file('GRP704+1.p',unknown),
[] ).
cnf(10,axiom,
equal(mult(mult(u,op_c),v),mult(u,mult(op_c,v))),
file('GRP704+1.p',unknown),
[] ).
cnf(12,axiom,
equal(mult(u,mult(v,ld(mult(u,v),op_c))),op),
file('GRP704+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ equal(mult(mult(skc10,op),skc11),mult(skc10,mult(op,skc11)))
| ~ equal(mult(mult(skc8,skc9),op),mult(skc8,mult(skc9,op)))
| ~ equal(mult(mult(op,skc6),skc7),mult(op,mult(skc6,skc7))) ),
file('GRP704+1.p',unknown),
[] ).
cnf(34,plain,
equal(op_d,op_c),
inference(spr,[status(thm),theory(equality)],[4,7]),
[iquote('0:SpR:4.0,7.0')] ).
cnf(39,plain,
equal(ld(u,mult(op_c,u)),op_c),
inference(rew,[status(thm),theory(equality)],[34,7]),
[iquote('0:Rew:34.0,7.0')] ).
cnf(56,plain,
equal(mult(u,op_c),mult(op_c,u)),
inference(spr,[status(thm),theory(equality)],[39,3]),
[iquote('0:SpR:39.0,3.0')] ).
cnf(59,plain,
equal(mult(op_c,mult(u,v)),mult(u,mult(v,op_c))),
inference(rew,[status(thm),theory(equality)],[56,9]),
[iquote('0:Rew:56.0,9.0')] ).
cnf(249,plain,
equal(mult(u,ld(mult(unit,u),op_c)),op),
inference(spr,[status(thm),theory(equality)],[12,2]),
[iquote('0:SpR:12.0,2.0')] ).
cnf(270,plain,
equal(op,op_c),
inference(rew,[status(thm),theory(equality)],[3,249,2]),
[iquote('0:Rew:3.0,249.0,2.0,249.0')] ).
cnf(272,plain,
( ~ equal(mult(mult(skc10,op_c),skc11),mult(skc10,mult(op_c,skc11)))
| ~ equal(mult(mult(skc8,skc9),op),mult(skc8,mult(skc9,op)))
| ~ equal(mult(mult(op,skc6),skc7),mult(op,mult(skc6,skc7))) ),
inference(rew,[status(thm),theory(equality)],[270,14]),
[iquote('0:Rew:270.0,14.0')] ).
cnf(301,plain,
( ~ equal(mult(skc10,mult(op_c,skc11)),mult(skc10,mult(op_c,skc11)))
| ~ equal(mult(mult(skc8,skc9),op),mult(skc8,mult(skc9,op)))
| ~ equal(mult(mult(op,skc6),skc7),mult(op,mult(skc6,skc7))) ),
inference(rew,[status(thm),theory(equality)],[10,272]),
[iquote('0:Rew:10.0,272.0')] ).
cnf(302,plain,
( ~ equal(mult(mult(skc8,skc9),op),mult(skc8,mult(skc9,op)))
| ~ equal(mult(mult(op,skc6),skc7),mult(op,mult(skc6,skc7))) ),
inference(obv,[status(thm),theory(equality)],[301]),
[iquote('0:Obv:301.0')] ).
cnf(303,plain,
( ~ equal(mult(mult(skc8,skc9),op_c),mult(op_c,mult(skc8,skc9)))
| ~ equal(mult(mult(op_c,skc6),skc7),mult(op_c,mult(skc6,skc7))) ),
inference(rew,[status(thm),theory(equality)],[270,302,59]),
[iquote('0:Rew:270.0,302.1,59.0,302.0,270.0,302.0')] ).
cnf(304,plain,
( ~ equal(mult(op_c,mult(skc8,skc9)),mult(op_c,mult(skc8,skc9)))
| ~ equal(mult(op_c,mult(skc6,skc7)),mult(op_c,mult(skc6,skc7))) ),
inference(rew,[status(thm),theory(equality)],[8,303,56]),
[iquote('0:Rew:8.0,303.1,56.0,303.0')] ).
cnf(305,plain,
$false,
inference(obv,[status(thm),theory(equality)],[304]),
[iquote('0:Obv:304.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : GRP704+1 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.14 % Command : run_spass %d %s
% 0.14/0.36 % Computer : n024.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Tue Jun 14 12:31:03 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.47
% 0.21/0.47 SPASS V 3.9
% 0.21/0.47 SPASS beiseite: Proof found.
% 0.21/0.47 % SZS status Theorem
% 0.21/0.47 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.47 SPASS derived 217 clauses, backtracked 0 clauses, performed 0 splits and kept 66 clauses.
% 0.21/0.47 SPASS allocated 85380 KBytes.
% 0.21/0.47 SPASS spent 0:00:00.10 on the problem.
% 0.21/0.47 0:00:00.03 for the input.
% 0.21/0.47 0:00:00.02 for the FLOTTER CNF translation.
% 0.21/0.47 0:00:00.00 for inferences.
% 0.21/0.47 0:00:00.00 for the backtracking.
% 0.21/0.47 0:00:00.02 for the reduction.
% 0.21/0.47
% 0.21/0.47
% 0.21/0.47 Here is a proof with depth 1, length 21 :
% 0.21/0.47 % SZS output start Refutation
% See solution above
% 0.21/0.47 Formulae used in the proof : f06 f01 f02 f11 f08 f09 f10 f13 goals
% 0.21/0.47
%------------------------------------------------------------------------------