TSTP Solution File: KLE074+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KLE074+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n016.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 : Sun Jul 17 02:28:23 EDT 2022
% Result : Theorem 0.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 7 unt; 0 nHn; 7 RR)
% Number of literals : 7 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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(12,axiom,
equal(domain__dfg(multiplication(u,domain__dfg(v))),domain__dfg(multiplication(u,v))),
file('KLE074+1.p',unknown),
[] ).
cnf(15,axiom,
equal(multiplication(multiplication(u,v),w),multiplication(u,multiplication(v,w))),
file('KLE074+1.p',unknown),
[] ).
cnf(19,axiom,
~ equal(domain__dfg(multiplication(multiplication(skc5,skc4),domain__dfg(skc3))),domain__dfg(multiplication(skc5,domain__dfg(multiplication(skc4,domain__dfg(skc3)))))),
file('KLE074+1.p',unknown),
[] ).
cnf(21,plain,
~ equal(domain__dfg(multiplication(skc5,multiplication(skc4,domain__dfg(skc3)))),domain__dfg(multiplication(skc5,multiplication(skc4,skc3)))),
inference(rew,[status(thm),theory(equality)],[15,19,12]),
[iquote('0:Rew:15.0,19.0,12.0,19.0,12.0,19.0')] ).
cnf(87,plain,
equal(domain__dfg(multiplication(u,multiplication(v,domain__dfg(w)))),domain__dfg(multiplication(u,domain__dfg(multiplication(v,w))))),
inference(spr,[status(thm),theory(equality)],[12]),
[iquote('0:SpR:12.0,12.0')] ).
cnf(98,plain,
equal(domain__dfg(multiplication(u,multiplication(v,domain__dfg(w)))),domain__dfg(multiplication(u,multiplication(v,w)))),
inference(rew,[status(thm),theory(equality)],[12,87]),
[iquote('0:Rew:12.0,87.0')] ).
cnf(99,plain,
$false,
inference(unc,[status(thm)],[98,21]),
[iquote('0:UnC:98.0,21.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE074+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 16 09:54:19 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.44
% 0.19/0.44 SPASS V 3.9
% 0.19/0.44 SPASS beiseite: Proof found.
% 0.19/0.44 % SZS status Theorem
% 0.19/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.44 SPASS derived 64 clauses, backtracked 0 clauses, performed 0 splits and kept 37 clauses.
% 0.19/0.44 SPASS allocated 85157 KBytes.
% 0.19/0.44 SPASS spent 0:00:00.08 on the problem.
% 0.19/0.44 0:00:00.03 for the input.
% 0.19/0.44 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.44 0:00:00.00 for inferences.
% 0.19/0.44 0:00:00.00 for the backtracking.
% 0.19/0.44 0:00:00.00 for the reduction.
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Here is a proof with depth 1, length 7 :
% 0.19/0.44 % SZS output start Refutation
% See solution above
% 0.19/0.44 Formulae used in the proof : domain2 multiplicative_associativity goals
% 0.19/0.44
%------------------------------------------------------------------------------