TSTP Solution File: GRP703+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GRP703+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n023.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:04 EDT 2022
% Result : Theorem 0.21s 0.45s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of clauses : 20 ( 17 unt; 0 nHn; 20 RR)
% Number of literals : 26 ( 0 equ; 9 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 : 15 ( 15 usr; 12 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(mult(u,unit),u),
file('GRP703+1.p',unknown),
[] ).
cnf(2,axiom,
equal(mult(unit,u),u),
file('GRP703+1.p',unknown),
[] ).
cnf(3,axiom,
equal(mult(u,ld(u,v)),v),
file('GRP703+1.p',unknown),
[] ).
cnf(4,axiom,
equal(ld(u,mult(u,v)),v),
file('GRP703+1.p',unknown),
[] ).
cnf(5,axiom,
equal(mult(rd(u,v),v),u),
file('GRP703+1.p',unknown),
[] ).
cnf(7,axiom,
equal(ld(u,mult(op_c,u)),op_d),
file('GRP703+1.p',unknown),
[] ).
cnf(8,axiom,
equal(mult(mult(op_c,u),v),mult(op_c,mult(u,v))),
file('GRP703+1.p',unknown),
[] ).
cnf(9,axiom,
equal(mult(mult(u,v),op_c),mult(u,mult(v,op_c))),
file('GRP703+1.p',unknown),
[] ).
cnf(10,axiom,
equal(mult(mult(u,op_c),v),mult(u,mult(op_c,v))),
file('GRP703+1.p',unknown),
[] ).
cnf(11,axiom,
equal(mult(mult(rd(op_c,mult(u,v)),v),u),op_e),
file('GRP703+1.p',unknown),
[] ).
cnf(14,axiom,
( ~ equal(mult(mult(skc10,op_e),skc11),mult(skc10,mult(op_e,skc11)))
| ~ equal(mult(mult(skc8,skc9),op_e),mult(skc8,mult(skc9,op_e)))
| ~ equal(mult(mult(op_e,skc6),skc7),mult(op_e,mult(skc6,skc7))) ),
file('GRP703+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(61,plain,
equal(mult(rd(op_c,mult(unit,u)),u),op_e),
inference(spr,[status(thm),theory(equality)],[11,1]),
[iquote('0:SpR:11.0,1.0')] ).
cnf(70,plain,
equal(op_e,op_c),
inference(rew,[status(thm),theory(equality)],[5,61,2]),
[iquote('0:Rew:5.0,61.0,2.0,61.0')] ).
cnf(72,plain,
( ~ equal(mult(mult(skc10,op_c),skc11),mult(skc10,mult(op_c,skc11)))
| ~ equal(mult(mult(skc8,skc9),op_e),mult(skc8,mult(skc9,op_e)))
| ~ equal(mult(mult(op_e,skc6),skc7),mult(op_e,mult(skc6,skc7))) ),
inference(rew,[status(thm),theory(equality)],[70,14]),
[iquote('0:Rew:70.0,14.0')] ).
cnf(82,plain,
( ~ equal(mult(skc10,mult(op_c,skc11)),mult(skc10,mult(op_c,skc11)))
| ~ 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,72,70,56,59,10]),
[iquote('0:Rew:8.0,72.2,70.0,72.2,56.0,72.1,59.0,72.1,70.0,72.1,10.0,72.0')] ).
cnf(83,plain,
$false,
inference(obv,[status(thm),theory(equality)],[82]),
[iquote('0:Obv:82.2')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP703+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n023.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 : Tue Jun 14 02:15:21 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.45
% 0.21/0.45 SPASS V 3.9
% 0.21/0.45 SPASS beiseite: Proof found.
% 0.21/0.45 % SZS status Theorem
% 0.21/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.45 SPASS derived 57 clauses, backtracked 0 clauses, performed 0 splits and kept 31 clauses.
% 0.21/0.45 SPASS allocated 85143 KBytes.
% 0.21/0.45 SPASS spent 0:00:00.08 on the problem.
% 0.21/0.45 0:00:00.04 for the input.
% 0.21/0.45 0:00:00.02 for the FLOTTER CNF translation.
% 0.21/0.45 0:00:00.00 for inferences.
% 0.21/0.45 0:00:00.00 for the backtracking.
% 0.21/0.45 0:00:00.00 for the reduction.
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45 Here is a proof with depth 1, length 20 :
% 0.21/0.45 % SZS output start Refutation
% See solution above
% 0.21/0.45 Formulae used in the proof : f05 f06 f01 f02 f03 f11 f08 f09 f10 f12 goals
% 0.21/0.45
%------------------------------------------------------------------------------