TSTP Solution File: KLE056+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : KLE056+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n005.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:18 EDT 2022
% Result : Theorem 0.18s 0.45s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 10 RR)
% Number of literals : 10 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
equal(domain__dfg(skc1),zero),
file('KLE056+1.p',unknown),
[] ).
cnf(2,axiom,
~ equal(skc1,zero),
file('KLE056+1.p',unknown),
[] ).
cnf(4,axiom,
equal(addition(u,zero),u),
file('KLE056+1.p',unknown),
[] ).
cnf(9,axiom,
equal(multiplication(zero,u),zero),
file('KLE056+1.p',unknown),
[] ).
cnf(11,axiom,
equal(addition(u,v),addition(v,u)),
file('KLE056+1.p',unknown),
[] ).
cnf(18,axiom,
equal(addition(u,multiplication(domain__dfg(u),u)),multiplication(domain__dfg(u),u)),
file('KLE056+1.p',unknown),
[] ).
cnf(38,plain,
equal(addition(zero,u),u),
inference(spr,[status(thm),theory(equality)],[11,4]),
[iquote('0:SpR:11.0,4.0')] ).
cnf(233,plain,
equal(addition(skc1,multiplication(zero,skc1)),multiplication(zero,skc1)),
inference(spr,[status(thm),theory(equality)],[1,18]),
[iquote('0:SpR:1.0,18.0')] ).
cnf(246,plain,
equal(skc1,zero),
inference(rew,[status(thm),theory(equality)],[38,233,11,9]),
[iquote('0:Rew:38.0,233.0,11.0,233.0,9.0,233.0')] ).
cnf(247,plain,
$false,
inference(mrr,[status(thm)],[246,2]),
[iquote('0:MRR:246.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : KLE056+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n005.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 16 13:59:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.45
% 0.18/0.45 SPASS V 3.9
% 0.18/0.45 SPASS beiseite: Proof found.
% 0.18/0.45 % SZS status Theorem
% 0.18/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.45 SPASS derived 174 clauses, backtracked 0 clauses, performed 0 splits and kept 70 clauses.
% 0.18/0.45 SPASS allocated 85286 KBytes.
% 0.18/0.45 SPASS spent 0:00:00.10 on the problem.
% 0.18/0.45 0:00:00.04 for the input.
% 0.18/0.45 0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.45 0:00:00.00 for inferences.
% 0.18/0.45 0:00:00.00 for the backtracking.
% 0.18/0.45 0:00:00.02 for the reduction.
% 0.18/0.45
% 0.18/0.45
% 0.18/0.45 Here is a proof with depth 1, length 10 :
% 0.18/0.45 % SZS output start Refutation
% See solution above
% 0.18/0.45 Formulae used in the proof : goals additive_identity left_annihilation additive_commutativity domain1
% 0.18/0.45
%------------------------------------------------------------------------------