TSTP Solution File: KLE008+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE008+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.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 : 300s
% DateTime : Thu Aug 31 05:31:37 EDT 2023
% Result : Theorem 69.05s 10.83s
% Output : CNFRefutation 69.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 18
% Syntax : Number of formulae : 135 ( 63 unt; 0 def)
% Number of atoms : 281 ( 132 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 221 ( 75 ~; 92 |; 35 &)
% ( 11 <=>; 7 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 162 ( 2 sgn; 89 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_commutativity) ).
fof(f2,axiom,
! [X2,X1,X0] : addition(X0,addition(X1,X2)) = addition(addition(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_associativity) ).
fof(f3,axiom,
! [X0] : addition(X0,zero) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_identity) ).
fof(f4,axiom,
! [X0] : addition(X0,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_idempotence) ).
fof(f5,axiom,
! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_associativity) ).
fof(f7,axiom,
! [X0] : multiplication(one,X0) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_left_identity) ).
fof(f8,axiom,
! [X0,X1,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_distributivity) ).
fof(f9,axiom,
! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_distributivity) ).
fof(f11,axiom,
! [X0] : zero = multiplication(zero,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_annihilation) ).
fof(f12,axiom,
! [X0,X1] :
( leq(X0,X1)
<=> addition(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order) ).
fof(f13,axiom,
! [X3] :
( test(X3)
<=> ? [X4] : complement(X4,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',test_1) ).
fof(f14,axiom,
! [X3,X4] :
( complement(X4,X3)
<=> ( one = addition(X3,X4)
& zero = multiplication(X4,X3)
& zero = multiplication(X3,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',test_2) ).
fof(f15,axiom,
! [X3,X4] :
( test(X3)
=> ( c(X3) = X4
<=> complement(X3,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',test_3) ).
fof(f17,conjecture,
! [X3,X4,X5] :
( test(X5)
=> ( leq(X3,multiplication(X5,X4))
<=> ( leq(multiplication(c(X5),X3),zero)
& leq(X3,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X3,X4,X5] :
( test(X5)
=> ( leq(X3,multiplication(X5,X4))
<=> ( leq(multiplication(c(X5),X3),zero)
& leq(X3,X4) ) ) ),
inference(negated_conjecture,[],[f17]) ).
fof(f19,plain,
! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(rectify,[],[f2]) ).
fof(f20,plain,
! [X0] :
( test(X0)
<=> ? [X1] : complement(X1,X0) ),
inference(rectify,[],[f13]) ).
fof(f21,plain,
! [X0,X1] :
( complement(X1,X0)
<=> ( addition(X0,X1) = one
& zero = multiplication(X1,X0)
& zero = multiplication(X0,X1) ) ),
inference(rectify,[],[f14]) ).
fof(f22,plain,
! [X0,X1] :
( test(X0)
=> ( c(X0) = X1
<=> complement(X0,X1) ) ),
inference(rectify,[],[f15]) ).
fof(f24,plain,
~ ! [X0,X1,X2] :
( test(X2)
=> ( leq(X0,multiplication(X2,X1))
<=> ( leq(multiplication(c(X2),X0),zero)
& leq(X0,X1) ) ) ),
inference(rectify,[],[f18]) ).
fof(f25,plain,
! [X0,X1] :
( ( c(X0) = X1
<=> complement(X0,X1) )
| ~ test(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f27,plain,
? [X0,X1,X2] :
( ( leq(X0,multiplication(X2,X1))
<~> ( leq(multiplication(c(X2),X0),zero)
& leq(X0,X1) ) )
& test(X2) ),
inference(ennf_transformation,[],[f24]) ).
fof(f28,plain,
! [X0,X1] :
( ( leq(X0,X1)
| addition(X0,X1) != X1 )
& ( addition(X0,X1) = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f29,plain,
! [X0] :
( ( test(X0)
| ! [X1] : ~ complement(X1,X0) )
& ( ? [X1] : complement(X1,X0)
| ~ test(X0) ) ),
inference(nnf_transformation,[],[f20]) ).
fof(f30,plain,
! [X0] :
( ( test(X0)
| ! [X1] : ~ complement(X1,X0) )
& ( ? [X2] : complement(X2,X0)
| ~ test(X0) ) ),
inference(rectify,[],[f29]) ).
fof(f31,plain,
! [X0] :
( ? [X2] : complement(X2,X0)
=> complement(sK0(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f32,plain,
! [X0] :
( ( test(X0)
| ! [X1] : ~ complement(X1,X0) )
& ( complement(sK0(X0),X0)
| ~ test(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f30,f31]) ).
fof(f33,plain,
! [X0,X1] :
( ( complement(X1,X0)
| addition(X0,X1) != one
| zero != multiplication(X1,X0)
| zero != multiplication(X0,X1) )
& ( ( addition(X0,X1) = one
& zero = multiplication(X1,X0)
& zero = multiplication(X0,X1) )
| ~ complement(X1,X0) ) ),
inference(nnf_transformation,[],[f21]) ).
fof(f34,plain,
! [X0,X1] :
( ( complement(X1,X0)
| addition(X0,X1) != one
| zero != multiplication(X1,X0)
| zero != multiplication(X0,X1) )
& ( ( addition(X0,X1) = one
& zero = multiplication(X1,X0)
& zero = multiplication(X0,X1) )
| ~ complement(X1,X0) ) ),
inference(flattening,[],[f33]) ).
fof(f35,plain,
! [X0,X1] :
( ( ( c(X0) = X1
| ~ complement(X0,X1) )
& ( complement(X0,X1)
| c(X0) != X1 ) )
| ~ test(X0) ),
inference(nnf_transformation,[],[f25]) ).
fof(f36,plain,
? [X0,X1,X2] :
( ( ~ leq(multiplication(c(X2),X0),zero)
| ~ leq(X0,X1)
| ~ leq(X0,multiplication(X2,X1)) )
& ( ( leq(multiplication(c(X2),X0),zero)
& leq(X0,X1) )
| leq(X0,multiplication(X2,X1)) )
& test(X2) ),
inference(nnf_transformation,[],[f27]) ).
fof(f37,plain,
? [X0,X1,X2] :
( ( ~ leq(multiplication(c(X2),X0),zero)
| ~ leq(X0,X1)
| ~ leq(X0,multiplication(X2,X1)) )
& ( ( leq(multiplication(c(X2),X0),zero)
& leq(X0,X1) )
| leq(X0,multiplication(X2,X1)) )
& test(X2) ),
inference(flattening,[],[f36]) ).
fof(f38,plain,
( ? [X0,X1,X2] :
( ( ~ leq(multiplication(c(X2),X0),zero)
| ~ leq(X0,X1)
| ~ leq(X0,multiplication(X2,X1)) )
& ( ( leq(multiplication(c(X2),X0),zero)
& leq(X0,X1) )
| leq(X0,multiplication(X2,X1)) )
& test(X2) )
=> ( ( ~ leq(multiplication(c(sK3),sK1),zero)
| ~ leq(sK1,sK2)
| ~ leq(sK1,multiplication(sK3,sK2)) )
& ( ( leq(multiplication(c(sK3),sK1),zero)
& leq(sK1,sK2) )
| leq(sK1,multiplication(sK3,sK2)) )
& test(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f39,plain,
( ( ~ leq(multiplication(c(sK3),sK1),zero)
| ~ leq(sK1,sK2)
| ~ leq(sK1,multiplication(sK3,sK2)) )
& ( ( leq(multiplication(c(sK3),sK1),zero)
& leq(sK1,sK2) )
| leq(sK1,multiplication(sK3,sK2)) )
& test(sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f37,f38]) ).
fof(f40,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f41,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f19]) ).
fof(f42,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f43,plain,
! [X0] : addition(X0,X0) = X0,
inference(cnf_transformation,[],[f4]) ).
fof(f44,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f46,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f47,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f48,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f50,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f11]) ).
fof(f51,plain,
! [X0,X1] :
( addition(X0,X1) = X1
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f52,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(cnf_transformation,[],[f28]) ).
fof(f53,plain,
! [X0] :
( complement(sK0(X0),X0)
| ~ test(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f55,plain,
! [X0,X1] :
( zero = multiplication(X0,X1)
| ~ complement(X1,X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f57,plain,
! [X0,X1] :
( addition(X0,X1) = one
| ~ complement(X1,X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f59,plain,
! [X0,X1] :
( complement(X0,X1)
| c(X0) != X1
| ~ test(X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f62,plain,
test(sK3),
inference(cnf_transformation,[],[f39]) ).
fof(f63,plain,
( leq(sK1,sK2)
| leq(sK1,multiplication(sK3,sK2)) ),
inference(cnf_transformation,[],[f39]) ).
fof(f64,plain,
( leq(multiplication(c(sK3),sK1),zero)
| leq(sK1,multiplication(sK3,sK2)) ),
inference(cnf_transformation,[],[f39]) ).
fof(f65,plain,
( ~ leq(multiplication(c(sK3),sK1),zero)
| ~ leq(sK1,sK2)
| ~ leq(sK1,multiplication(sK3,sK2)) ),
inference(cnf_transformation,[],[f39]) ).
fof(f66,plain,
! [X0] :
( complement(X0,c(X0))
| ~ test(X0) ),
inference(equality_resolution,[],[f59]) ).
cnf(c_49,plain,
addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f40]) ).
cnf(c_50,plain,
addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f41]) ).
cnf(c_51,plain,
addition(X0,zero) = X0,
inference(cnf_transformation,[],[f42]) ).
cnf(c_52,plain,
addition(X0,X0) = X0,
inference(cnf_transformation,[],[f43]) ).
cnf(c_53,plain,
multiplication(multiplication(X0,X1),X2) = multiplication(X0,multiplication(X1,X2)),
inference(cnf_transformation,[],[f44]) ).
cnf(c_55,plain,
multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f46]) ).
cnf(c_56,plain,
addition(multiplication(X0,X1),multiplication(X0,X2)) = multiplication(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f47]) ).
cnf(c_57,plain,
addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
inference(cnf_transformation,[],[f48]) ).
cnf(c_59,plain,
multiplication(zero,X0) = zero,
inference(cnf_transformation,[],[f50]) ).
cnf(c_60,plain,
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f52]) ).
cnf(c_61,plain,
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(cnf_transformation,[],[f51]) ).
cnf(c_63,plain,
( ~ test(X0)
| complement(sK0(X0),X0) ),
inference(cnf_transformation,[],[f53]) ).
cnf(c_65,plain,
( ~ complement(X0,X1)
| addition(X1,X0) = one ),
inference(cnf_transformation,[],[f57]) ).
cnf(c_67,plain,
( ~ complement(X0,X1)
| multiplication(X1,X0) = zero ),
inference(cnf_transformation,[],[f55]) ).
cnf(c_69,plain,
( ~ test(X0)
| complement(X0,c(X0)) ),
inference(cnf_transformation,[],[f66]) ).
cnf(c_71,negated_conjecture,
( ~ leq(multiplication(c(sK3),sK1),zero)
| ~ leq(sK1,multiplication(sK3,sK2))
| ~ leq(sK1,sK2) ),
inference(cnf_transformation,[],[f65]) ).
cnf(c_72,negated_conjecture,
( leq(multiplication(c(sK3),sK1),zero)
| leq(sK1,multiplication(sK3,sK2)) ),
inference(cnf_transformation,[],[f64]) ).
cnf(c_73,negated_conjecture,
( leq(sK1,multiplication(sK3,sK2))
| leq(sK1,sK2) ),
inference(cnf_transformation,[],[f63]) ).
cnf(c_74,negated_conjecture,
test(sK3),
inference(cnf_transformation,[],[f62]) ).
cnf(c_79,plain,
addition(zero,zero) = zero,
inference(instantiation,[status(thm)],[c_52]) ).
cnf(c_85,plain,
( addition(zero,zero) != zero
| leq(zero,zero) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_570,plain,
X0 = X0,
theory(equality) ).
cnf(c_575,plain,
( X0 != X1
| X2 != X3
| ~ leq(X1,X3)
| leq(X0,X2) ),
theory(equality) ).
cnf(c_581,plain,
zero = zero,
inference(instantiation,[status(thm)],[c_570]) ).
cnf(c_1097,plain,
addition(zero,X0) = X0,
inference(superposition,[status(thm)],[c_51,c_49]) ).
cnf(c_1128,plain,
( addition(sK1,multiplication(sK3,sK2)) = multiplication(sK3,sK2)
| leq(multiplication(c(sK3),sK1),zero) ),
inference(superposition,[status(thm)],[c_72,c_61]) ).
cnf(c_1129,plain,
( addition(sK1,multiplication(sK3,sK2)) = multiplication(sK3,sK2)
| leq(sK1,sK2) ),
inference(superposition,[status(thm)],[c_73,c_61]) ).
cnf(c_1140,plain,
( addition(sK1,multiplication(sK3,sK2)) = multiplication(sK3,sK2)
| addition(sK1,sK2) = sK2 ),
inference(superposition,[status(thm)],[c_1129,c_61]) ).
cnf(c_1170,plain,
( ~ test(X0)
| addition(X0,sK0(X0)) = one ),
inference(superposition,[status(thm)],[c_63,c_65]) ).
cnf(c_1219,plain,
( addition(multiplication(c(sK3),sK1),zero) = zero
| addition(sK1,multiplication(sK3,sK2)) = multiplication(sK3,sK2) ),
inference(superposition,[status(thm)],[c_1128,c_61]) ).
cnf(c_1221,plain,
( addition(zero,multiplication(c(sK3),sK1)) = zero
| addition(sK1,multiplication(sK3,sK2)) = multiplication(sK3,sK2) ),
inference(theory_normalisation,[status(thm)],[c_1219,c_50,c_49]) ).
cnf(c_1233,plain,
( addition(sK1,addition(multiplication(sK3,sK2),X0)) = addition(multiplication(sK3,sK2),X0)
| addition(sK1,sK2) = sK2 ),
inference(superposition,[status(thm)],[c_1140,c_50]) ).
cnf(c_1249,plain,
( addition(sK1,multiplication(sK3,sK2)) = multiplication(sK3,sK2)
| multiplication(c(sK3),sK1) = zero ),
inference(demodulation,[status(thm)],[c_1221,c_1097]) ).
cnf(c_1255,plain,
( multiplication(c(sK3),sK1) = zero
| leq(sK1,multiplication(sK3,sK2)) ),
inference(superposition,[status(thm)],[c_1249,c_60]) ).
cnf(c_1293,plain,
( addition(sK1,sK2) != sK2
| leq(sK1,sK2) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_1412,plain,
( multiplication(c(sK3),sK1) != X0
| zero != X1
| ~ leq(X0,X1)
| leq(multiplication(c(sK3),sK1),zero) ),
inference(instantiation,[status(thm)],[c_575]) ).
cnf(c_1413,plain,
( multiplication(c(sK3),sK1) != zero
| zero != zero
| ~ leq(zero,zero)
| leq(multiplication(c(sK3),sK1),zero) ),
inference(instantiation,[status(thm)],[c_1412]) ).
cnf(c_1992,plain,
( addition(sK1,multiplication(sK3,sK2)) = multiplication(sK3,sK2)
| leq(sK1,sK2) ),
inference(superposition,[status(thm)],[c_73,c_61]) ).
cnf(c_2078,plain,
( addition(sK1,multiplication(sK3,sK2)) = multiplication(sK3,sK2)
| addition(sK1,sK2) = sK2 ),
inference(superposition,[status(thm)],[c_1992,c_61]) ).
cnf(c_2086,plain,
addition(sK3,sK0(sK3)) = one,
inference(superposition,[status(thm)],[c_74,c_1170]) ).
cnf(c_2120,plain,
addition(multiplication(sK3,X0),multiplication(sK0(sK3),X0)) = multiplication(one,X0),
inference(superposition,[status(thm)],[c_2086,c_57]) ).
cnf(c_2125,plain,
addition(multiplication(sK3,X0),multiplication(sK0(sK3),X0)) = X0,
inference(light_normalisation,[status(thm)],[c_2120,c_55]) ).
cnf(c_3025,plain,
( addition(multiplication(sK1,X0),multiplication(multiplication(sK3,sK2),X0)) = multiplication(multiplication(sK3,sK2),X0)
| addition(sK1,sK2) = sK2 ),
inference(superposition,[status(thm)],[c_2078,c_57]) ).
cnf(c_3599,plain,
addition(sK1,sK2) = sK2,
inference(superposition,[status(thm)],[c_2125,c_1233]) ).
cnf(c_3935,plain,
addition(sK1,sK2) = sK2,
inference(global_subsumption_just,[status(thm)],[c_3025,c_3599]) ).
cnf(c_3942,plain,
leq(sK1,sK2),
inference(superposition,[status(thm)],[c_3935,c_60]) ).
cnf(c_3949,plain,
( ~ leq(multiplication(c(sK3),sK1),zero)
| ~ leq(sK1,multiplication(sK3,sK2)) ),
inference(backward_subsumption_resolution,[status(thm)],[c_71,c_3942]) ).
cnf(c_14127,plain,
addition(zero,X0) = X0,
inference(superposition,[status(thm)],[c_49,c_51]) ).
cnf(c_14201,plain,
( addition(sK1,multiplication(sK3,sK2)) = multiplication(sK3,sK2)
| leq(multiplication(c(sK3),sK1),zero) ),
inference(superposition,[status(thm)],[c_72,c_61]) ).
cnf(c_14232,plain,
( ~ test(X0)
| multiplication(c(X0),X0) = zero ),
inference(superposition,[status(thm)],[c_69,c_67]) ).
cnf(c_14300,plain,
( addition(multiplication(c(sK3),sK1),zero) = zero
| addition(sK1,multiplication(sK3,sK2)) = multiplication(sK3,sK2) ),
inference(superposition,[status(thm)],[c_14201,c_61]) ).
cnf(c_14304,plain,
( addition(zero,multiplication(c(sK3),sK1)) = zero
| addition(sK1,multiplication(sK3,sK2)) = multiplication(sK3,sK2) ),
inference(theory_normalisation,[status(thm)],[c_14300,c_50,c_49]) ).
cnf(c_14414,plain,
multiplication(c(sK3),sK3) = zero,
inference(superposition,[status(thm)],[c_74,c_14232]) ).
cnf(c_14420,plain,
multiplication(c(sK3),multiplication(sK3,X0)) = multiplication(zero,X0),
inference(superposition,[status(thm)],[c_14414,c_53]) ).
cnf(c_14421,plain,
multiplication(c(sK3),multiplication(sK3,X0)) = zero,
inference(light_normalisation,[status(thm)],[c_14420,c_59]) ).
cnf(c_14485,plain,
( addition(sK1,multiplication(sK3,sK2)) = multiplication(sK3,sK2)
| multiplication(c(sK3),sK1) = zero ),
inference(demodulation,[status(thm)],[c_14304,c_14127]) ).
cnf(c_14492,plain,
( addition(multiplication(X0,sK1),multiplication(X0,multiplication(sK3,sK2))) = multiplication(X0,multiplication(sK3,sK2))
| multiplication(c(sK3),sK1) = zero ),
inference(superposition,[status(thm)],[c_14485,c_56]) ).
cnf(c_142034,plain,
( addition(multiplication(X0,multiplication(X1,sK1)),multiplication(multiplication(X0,X1),multiplication(sK3,sK2))) = multiplication(multiplication(X0,X1),multiplication(sK3,sK2))
| multiplication(c(sK3),sK1) = zero ),
inference(superposition,[status(thm)],[c_53,c_14492]) ).
cnf(c_142059,plain,
( multiplication(c(sK3),sK1) = zero
| leq(multiplication(X0,sK1),multiplication(X0,multiplication(sK3,sK2))) ),
inference(superposition,[status(thm)],[c_14492,c_60]) ).
cnf(c_143736,plain,
( multiplication(c(sK3),sK1) = zero
| leq(multiplication(c(sK3),sK1),zero) ),
inference(superposition,[status(thm)],[c_14421,c_142059]) ).
cnf(c_148220,plain,
multiplication(c(sK3),sK1) = zero,
inference(global_subsumption_just,[status(thm)],[c_142034,c_71,c_1255,c_1293,c_3599,c_143736]) ).
cnf(c_200097,negated_conjecture,
leq(sK1,sK2),
inference(global_subsumption_just,[status(thm)],[c_73,c_1293,c_3599]) ).
cnf(c_200099,negated_conjecture,
leq(multiplication(c(sK3),sK1),zero),
inference(global_subsumption_just,[status(thm)],[c_72,c_79,c_85,c_581,c_1413,c_148220]) ).
cnf(c_200101,negated_conjecture,
~ leq(sK1,multiplication(sK3,sK2)),
inference(global_subsumption_just,[status(thm)],[c_71,c_79,c_85,c_71,c_581,c_1255,c_1293,c_1413,c_3599,c_3949,c_143736]) ).
cnf(c_200109,plain,
addition(zero,X0) = X0,
inference(superposition,[status(thm)],[c_51,c_49]) ).
cnf(c_200165,plain,
addition(multiplication(c(sK3),sK1),zero) = zero,
inference(superposition,[status(thm)],[c_200099,c_61]) ).
cnf(c_200166,plain,
addition(sK1,sK2) = sK2,
inference(superposition,[status(thm)],[c_200097,c_61]) ).
cnf(c_200169,plain,
addition(zero,multiplication(c(sK3),sK1)) = zero,
inference(theory_normalisation,[status(thm)],[c_200165,c_50,c_49]) ).
cnf(c_200177,plain,
( ~ test(X0)
| addition(c(X0),X0) = one ),
inference(superposition,[status(thm)],[c_69,c_65]) ).
cnf(c_200178,plain,
( ~ test(X0)
| addition(X0,c(X0)) = one ),
inference(theory_normalisation,[status(thm)],[c_200177,c_50,c_49]) ).
cnf(c_200211,plain,
multiplication(c(sK3),sK1) = zero,
inference(demodulation,[status(thm)],[c_200169,c_200109]) ).
cnf(c_200295,plain,
addition(multiplication(X0,sK1),multiplication(X0,sK2)) = multiplication(X0,sK2),
inference(superposition,[status(thm)],[c_200166,c_56]) ).
cnf(c_200421,plain,
leq(multiplication(X0,sK1),multiplication(X0,sK2)),
inference(superposition,[status(thm)],[c_200295,c_60]) ).
cnf(c_214829,plain,
addition(sK3,c(sK3)) = one,
inference(superposition,[status(thm)],[c_74,c_200178]) ).
cnf(c_214880,plain,
addition(multiplication(sK3,X0),multiplication(c(sK3),X0)) = multiplication(one,X0),
inference(superposition,[status(thm)],[c_214829,c_57]) ).
cnf(c_214941,plain,
addition(multiplication(sK3,X0),multiplication(c(sK3),X0)) = X0,
inference(light_normalisation,[status(thm)],[c_214880,c_55]) ).
cnf(c_228642,plain,
addition(multiplication(sK3,sK1),zero) = sK1,
inference(superposition,[status(thm)],[c_200211,c_214941]) ).
cnf(c_228739,plain,
addition(zero,multiplication(sK3,sK1)) = sK1,
inference(theory_normalisation,[status(thm)],[c_228642,c_50,c_49]) ).
cnf(c_242111,plain,
multiplication(sK3,sK1) = sK1,
inference(demodulation,[status(thm)],[c_228739,c_200109]) ).
cnf(c_242129,plain,
leq(sK1,multiplication(sK3,sK2)),
inference(superposition,[status(thm)],[c_242111,c_200421]) ).
cnf(c_242159,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_242129,c_200101]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE008+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n007.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 29 11:50:59 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 69.05/10.83 % SZS status Started for theBenchmark.p
% 69.05/10.83 % SZS status Theorem for theBenchmark.p
% 69.05/10.83
% 69.05/10.83 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 69.05/10.83
% 69.05/10.83 ------ iProver source info
% 69.05/10.83
% 69.05/10.83 git: date: 2023-05-31 18:12:56 +0000
% 69.05/10.83 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 69.05/10.83 git: non_committed_changes: false
% 69.05/10.83 git: last_make_outside_of_git: false
% 69.05/10.83
% 69.05/10.83 ------ Parsing...
% 69.05/10.83 ------ Clausification by vclausify_rel & Parsing by iProver...
% 69.05/10.83
% 69.05/10.83 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 69.05/10.83
% 69.05/10.83 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 69.05/10.83
% 69.05/10.83 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 69.05/10.83 ------ Proving...
% 69.05/10.83 ------ Problem Properties
% 69.05/10.83
% 69.05/10.83
% 69.05/10.83 clauses 26
% 69.05/10.83 conjectures 4
% 69.05/10.83 EPR 2
% 69.05/10.83 Horn 23
% 69.05/10.83 unary 12
% 69.05/10.83 binary 11
% 69.05/10.83 lits 44
% 69.05/10.83 lits eq 21
% 69.05/10.83 fd_pure 0
% 69.05/10.83 fd_pseudo 0
% 69.05/10.83 fd_cond 0
% 69.05/10.83 fd_pseudo_cond 1
% 69.05/10.83 AC symbols 1
% 69.05/10.83
% 69.05/10.83 ------ Schedule dynamic 5 is on
% 69.05/10.83
% 69.05/10.83 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 69.05/10.83
% 69.05/10.83
% 69.05/10.83 ------
% 69.05/10.83 Current options:
% 69.05/10.83 ------
% 69.05/10.83
% 69.05/10.83
% 69.05/10.83
% 69.05/10.83
% 69.05/10.83 ------ Proving...
% 69.05/10.83
% 69.05/10.83
% 69.05/10.83 % SZS status Theorem for theBenchmark.p
% 69.05/10.83
% 69.05/10.83 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 69.05/10.83
% 69.05/10.83
%------------------------------------------------------------------------------