TSTP Solution File: KLE119+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KLE119+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n014.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:36 EDT 2022
% Result : Theorem 0.20s 0.45s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 22 RR)
% Number of literals : 22 ( 0 equ; 4 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 : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(addition(u,zero),u),
file('KLE119+1.p',unknown),
[] ).
cnf(4,axiom,
equal(multiplication(one,u),u),
file('KLE119+1.p',unknown),
[] ).
cnf(5,axiom,
equal(multiplication(u,zero),zero),
file('KLE119+1.p',unknown),
[] ).
cnf(8,axiom,
equal(domain__dfg(u),antidomain(antidomain(u))),
file('KLE119+1.p',unknown),
[] ).
cnf(9,axiom,
equal(multiplication(u,coantidomain(u)),zero),
file('KLE119+1.p',unknown),
[] ).
cnf(10,axiom,
equal(codomain(u),coantidomain(coantidomain(u))),
file('KLE119+1.p',unknown),
[] ).
cnf(12,axiom,
equal(addition(u,v),addition(v,u)),
file('KLE119+1.p',unknown),
[] ).
cnf(14,axiom,
equal(addition(coantidomain(coantidomain(u)),coantidomain(u)),one),
file('KLE119+1.p',unknown),
[] ).
cnf(19,axiom,
equal(codomain(multiplication(codomain(u),v)),backward_diamond(v,u)),
file('KLE119+1.p',unknown),
[] ).
cnf(22,axiom,
~ equal(addition(backward_diamond(zero,domain__dfg(skc3)),domain__dfg(skc2)),domain__dfg(skc2)),
file('KLE119+1.p',unknown),
[] ).
cnf(30,plain,
equal(addition(coantidomain(u),coantidomain(coantidomain(u))),one),
inference(rew,[status(thm),theory(equality)],[12,14]),
[iquote('0:Rew:12.0,14.0')] ).
cnf(34,plain,
equal(coantidomain(coantidomain(multiplication(coantidomain(coantidomain(u)),v))),backward_diamond(v,u)),
inference(rew,[status(thm),theory(equality)],[10,19]),
[iquote('0:Rew:10.0,19.0,10.0,19.0')] ).
cnf(38,plain,
~ equal(addition(antidomain(antidomain(skc2)),backward_diamond(zero,antidomain(antidomain(skc3)))),antidomain(antidomain(skc2))),
inference(rew,[status(thm),theory(equality)],[12,22,8]),
[iquote('0:Rew:12.0,22.0,8.0,22.0,8.0,22.0')] ).
cnf(56,plain,
equal(coantidomain(one),zero),
inference(spr,[status(thm),theory(equality)],[9,4]),
[iquote('0:SpR:9.0,4.0')] ).
cnf(63,plain,
equal(addition(zero,u),u),
inference(spr,[status(thm),theory(equality)],[12,1]),
[iquote('0:SpR:12.0,1.0')] ).
cnf(72,plain,
equal(addition(zero,coantidomain(zero)),one),
inference(spr,[status(thm),theory(equality)],[56,30]),
[iquote('0:SpR:56.0,30.0')] ).
cnf(74,plain,
equal(coantidomain(zero),one),
inference(rew,[status(thm),theory(equality)],[63,72]),
[iquote('0:Rew:63.0,72.0')] ).
cnf(161,plain,
equal(backward_diamond(zero,u),coantidomain(coantidomain(zero))),
inference(spr,[status(thm),theory(equality)],[5,34]),
[iquote('0:SpR:5.0,34.0')] ).
cnf(164,plain,
equal(backward_diamond(zero,u),zero),
inference(rew,[status(thm),theory(equality)],[56,161,74]),
[iquote('0:Rew:56.0,161.0,74.0,161.0')] ).
cnf(165,plain,
~ equal(addition(antidomain(antidomain(skc2)),zero),antidomain(antidomain(skc2))),
inference(rew,[status(thm),theory(equality)],[164,38]),
[iquote('0:Rew:164.0,38.0')] ).
cnf(169,plain,
~ equal(antidomain(antidomain(skc2)),antidomain(antidomain(skc2))),
inference(rew,[status(thm),theory(equality)],[63,165,12]),
[iquote('0:Rew:63.0,165.0,12.0,165.0')] ).
cnf(170,plain,
$false,
inference(obv,[status(thm),theory(equality)],[169]),
[iquote('0:Obv:169.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KLE119+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n014.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 12:53:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45
% 0.20/0.45 SPASS V 3.9
% 0.20/0.45 SPASS beiseite: Proof found.
% 0.20/0.45 % SZS status Theorem
% 0.20/0.45 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.45 SPASS derived 113 clauses, backtracked 0 clauses, performed 0 splits and kept 66 clauses.
% 0.20/0.45 SPASS allocated 85227 KBytes.
% 0.20/0.45 SPASS spent 0:00:00.10 on the problem.
% 0.20/0.45 0:00:00.04 for the input.
% 0.20/0.45 0:00:00.03 for the FLOTTER CNF translation.
% 0.20/0.45 0:00:00.00 for inferences.
% 0.20/0.45 0:00:00.00 for the backtracking.
% 0.20/0.45 0:00:00.01 for the reduction.
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 Here is a proof with depth 2, length 22 :
% 0.20/0.45 % SZS output start Refutation
% See solution above
% 0.20/0.45 Formulae used in the proof : additive_identity multiplicative_left_identity right_annihilation domain4 codomain1 codomain4 additive_commutativity codomain3 backward_diamond goals
% 0.20/0.45
%------------------------------------------------------------------------------