TSTP Solution File: KLE059+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KLE059+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n015.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:19 EDT 2022
% Result : Theorem 0.19s 0.43s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of clauses : 6 ( 6 unt; 0 nHn; 6 RR)
% Number of literals : 6 ( 0 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
equal(addition(skc2,skc3),skc3),
file('KLE059+1.p',unknown),
[] ).
cnf(11,axiom,
~ equal(addition(domain__dfg(skc2),domain__dfg(skc3)),domain__dfg(skc3)),
file('KLE059+1.p',unknown),
[] ).
cnf(15,axiom,
equal(addition(domain__dfg(u),domain__dfg(v)),domain__dfg(addition(u,v))),
file('KLE059+1.p',unknown),
[] ).
cnf(22,plain,
~ equal(domain__dfg(addition(skc2,skc3)),domain__dfg(skc3)),
inference(rew,[status(thm),theory(equality)],[15,11]),
[iquote('0:Rew:15.0,11.0')] ).
cnf(23,plain,
~ equal(domain__dfg(skc3),domain__dfg(skc3)),
inference(rew,[status(thm),theory(equality)],[2,22]),
[iquote('0:Rew:2.0,22.0')] ).
cnf(24,plain,
$false,
inference(obv,[status(thm),theory(equality)],[23]),
[iquote('0:Obv:23.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE059+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n015.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 08:31:26 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.43
% 0.19/0.43 SPASS V 3.9
% 0.19/0.43 SPASS beiseite: Proof found.
% 0.19/0.43 % SZS status Theorem
% 0.19/0.43 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.43 SPASS derived 2 clauses, backtracked 0 clauses, performed 0 splits and kept 16 clauses.
% 0.19/0.43 SPASS allocated 85129 KBytes.
% 0.19/0.43 SPASS spent 0:00:00.08 on the problem.
% 0.19/0.43 0:00:00.04 for the input.
% 0.19/0.43 0:00:00.03 for the FLOTTER CNF translation.
% 0.19/0.43 0:00:00.00 for inferences.
% 0.19/0.43 0:00:00.00 for the backtracking.
% 0.19/0.43 0:00:00.00 for the reduction.
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Here is a proof with depth 0, length 6 :
% 0.19/0.43 % SZS output start Refutation
% See solution above
% 0.19/0.43 Formulae used in the proof : goals domain5
% 0.19/0.43
%------------------------------------------------------------------------------