TSTP Solution File: GRP665-10 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : GRP665-10 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n028.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:49 EDT 2022
% Result : Unsatisfiable 0.20s 0.44s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 12 RR)
% Number of literals : 12 ( 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 : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(mult(u,ld(u,v)),v),
file('GRP665-10.p',unknown),
[] ).
cnf(2,axiom,
equal(ld(u,mult(u,v)),v),
file('GRP665-10.p',unknown),
[] ).
cnf(8,axiom,
equal(mult(mult(u,v),ld(v,mult(w,v))),mult(mult(u,w),v)),
file('GRP665-10.p',unknown),
[] ).
cnf(9,axiom,
equal(mult(op_c,u),mult(u,op_c)),
file('GRP665-10.p',unknown),
[] ).
cnf(10,axiom,
~ equal(mult(mult(op_c,x0__dfg),x1__dfg),mult(op_c,mult(x0__dfg,x1__dfg))),
file('GRP665-10.p',unknown),
[] ).
cnf(52,plain,
equal(ld(op_c,mult(u,op_c)),u),
inference(spr,[status(thm),theory(equality)],[9,2]),
[iquote('0:SpR:9.0,2.0')] ).
cnf(235,plain,
equal(mult(mult(u,op_c),v),mult(mult(u,v),op_c)),
inference(spr,[status(thm),theory(equality)],[52,8]),
[iquote('0:SpR:52.0,8.0')] ).
cnf(239,plain,
equal(mult(mult(u,op_c),ld(u,mult(v,u))),mult(mult(op_c,v),u)),
inference(spr,[status(thm),theory(equality)],[9,8]),
[iquote('0:SpR:9.0,8.0')] ).
cnf(248,plain,
equal(mult(mult(u,op_c),v),mult(op_c,mult(u,v))),
inference(rew,[status(thm),theory(equality)],[9,235]),
[iquote('0:Rew:9.0,235.0')] ).
cnf(257,plain,
equal(mult(op_c,mult(u,ld(u,mult(v,u)))),mult(mult(op_c,v),u)),
inference(rew,[status(thm),theory(equality)],[248,239]),
[iquote('0:Rew:248.0,239.0')] ).
cnf(258,plain,
equal(mult(mult(op_c,u),v),mult(op_c,mult(u,v))),
inference(rew,[status(thm),theory(equality)],[1,257]),
[iquote('0:Rew:1.0,257.0')] ).
cnf(259,plain,
$false,
inference(unc,[status(thm)],[258,10]),
[iquote('0:UnC:258.0,10.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP665-10 : TPTP v8.1.0. Released v8.1.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n028.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 13 14:47:37 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.44
% 0.20/0.44 SPASS V 3.9
% 0.20/0.44 SPASS beiseite: Proof found.
% 0.20/0.44 % SZS status Theorem
% 0.20/0.44 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.44 SPASS derived 210 clauses, backtracked 0 clauses, performed 0 splits and kept 68 clauses.
% 0.20/0.44 SPASS allocated 63399 KBytes.
% 0.20/0.44 SPASS spent 0:00:00.08 on the problem.
% 0.20/0.44 0:00:00.03 for the input.
% 0.20/0.44 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.44 0:00:00.00 for inferences.
% 0.20/0.44 0:00:00.00 for the backtracking.
% 0.20/0.44 0:00:00.02 for the reduction.
% 0.20/0.44
% 0.20/0.44
% 0.20/0.44 Here is a proof with depth 2, length 12 :
% 0.20/0.44 % SZS output start Refutation
% See solution above
% 0.20/0.44 Formulae used in the proof : f01 f02 f08 f09 goal
% 0.20/0.44
%------------------------------------------------------------------------------