TSTP Solution File: KLE034+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : KLE034+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n018.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:49 EDT 2023
% Result : Theorem 53.31s 8.26s
% Output : CNFRefutation 53.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 16
% Syntax : Number of formulae : 125 ( 77 unt; 0 def)
% Number of atoms : 241 ( 115 equ)
% Maximal formula atoms : 12 ( 1 avg)
% Number of connectives : 180 ( 64 ~; 49 |; 52 &)
% ( 8 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 171 ( 3 sgn; 95 !; 20 ?)
% 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(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(f6,axiom,
! [X0] : multiplication(X0,one) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_right_identity) ).
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,X6,X7] :
( ( leq(multiplication(multiplication(X6,X4),c(X7)),zero)
& leq(multiplication(multiplication(X5,X3),c(X6)),zero)
& test(X7)
& test(X5)
& test(X6) )
=> leq(multiplication(multiplication(multiplication(X5,X3),X4),c(X7)),zero) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f18,negated_conjecture,
~ ! [X3,X4,X5,X6,X7] :
( ( leq(multiplication(multiplication(X6,X4),c(X7)),zero)
& leq(multiplication(multiplication(X5,X3),c(X6)),zero)
& test(X7)
& test(X5)
& test(X6) )
=> leq(multiplication(multiplication(multiplication(X5,X3),X4),c(X7)),zero) ),
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,X3,X4] :
( ( leq(multiplication(multiplication(X3,X1),c(X4)),zero)
& leq(multiplication(multiplication(X2,X0),c(X3)),zero)
& test(X4)
& test(X2)
& test(X3) )
=> leq(multiplication(multiplication(multiplication(X2,X0),X1),c(X4)),zero) ),
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,X3,X4] :
( ~ leq(multiplication(multiplication(multiplication(X2,X0),X1),c(X4)),zero)
& leq(multiplication(multiplication(X3,X1),c(X4)),zero)
& leq(multiplication(multiplication(X2,X0),c(X3)),zero)
& test(X4)
& test(X2)
& test(X3) ),
inference(ennf_transformation,[],[f24]) ).
fof(f28,plain,
? [X0,X1,X2,X3,X4] :
( ~ leq(multiplication(multiplication(multiplication(X2,X0),X1),c(X4)),zero)
& leq(multiplication(multiplication(X3,X1),c(X4)),zero)
& leq(multiplication(multiplication(X2,X0),c(X3)),zero)
& test(X4)
& test(X2)
& test(X3) ),
inference(flattening,[],[f27]) ).
fof(f29,plain,
! [X0,X1] :
( ( leq(X0,X1)
| addition(X0,X1) != X1 )
& ( addition(X0,X1) = X1
| ~ leq(X0,X1) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f30,plain,
! [X0] :
( ( test(X0)
| ! [X1] : ~ complement(X1,X0) )
& ( ? [X1] : complement(X1,X0)
| ~ test(X0) ) ),
inference(nnf_transformation,[],[f20]) ).
fof(f31,plain,
! [X0] :
( ( test(X0)
| ! [X1] : ~ complement(X1,X0) )
& ( ? [X2] : complement(X2,X0)
| ~ test(X0) ) ),
inference(rectify,[],[f30]) ).
fof(f32,plain,
! [X0] :
( ? [X2] : complement(X2,X0)
=> complement(sK0(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
! [X0] :
( ( test(X0)
| ! [X1] : ~ complement(X1,X0) )
& ( complement(sK0(X0),X0)
| ~ test(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f31,f32]) ).
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(nnf_transformation,[],[f21]) ).
fof(f35,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,[],[f34]) ).
fof(f36,plain,
! [X0,X1] :
( ( ( c(X0) = X1
| ~ complement(X0,X1) )
& ( complement(X0,X1)
| c(X0) != X1 ) )
| ~ test(X0) ),
inference(nnf_transformation,[],[f25]) ).
fof(f37,plain,
( ? [X0,X1,X2,X3,X4] :
( ~ leq(multiplication(multiplication(multiplication(X2,X0),X1),c(X4)),zero)
& leq(multiplication(multiplication(X3,X1),c(X4)),zero)
& leq(multiplication(multiplication(X2,X0),c(X3)),zero)
& test(X4)
& test(X2)
& test(X3) )
=> ( ~ leq(multiplication(multiplication(multiplication(sK3,sK1),sK2),c(sK5)),zero)
& leq(multiplication(multiplication(sK4,sK2),c(sK5)),zero)
& leq(multiplication(multiplication(sK3,sK1),c(sK4)),zero)
& test(sK5)
& test(sK3)
& test(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f38,plain,
( ~ leq(multiplication(multiplication(multiplication(sK3,sK1),sK2),c(sK5)),zero)
& leq(multiplication(multiplication(sK4,sK2),c(sK5)),zero)
& leq(multiplication(multiplication(sK3,sK1),c(sK4)),zero)
& test(sK5)
& test(sK3)
& test(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5])],[f28,f37]) ).
fof(f39,plain,
! [X0,X1] : addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f1]) ).
fof(f40,plain,
! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
inference(cnf_transformation,[],[f19]) ).
fof(f41,plain,
! [X0] : addition(X0,zero) = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f43,plain,
! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
inference(cnf_transformation,[],[f5]) ).
fof(f44,plain,
! [X0] : multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f6]) ).
fof(f45,plain,
! [X0] : multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f7]) ).
fof(f46,plain,
! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
inference(cnf_transformation,[],[f8]) ).
fof(f47,plain,
! [X2,X0,X1] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
inference(cnf_transformation,[],[f9]) ).
fof(f49,plain,
! [X0] : zero = multiplication(zero,X0),
inference(cnf_transformation,[],[f11]) ).
fof(f50,plain,
! [X0,X1] :
( addition(X0,X1) = X1
| ~ leq(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f51,plain,
! [X0,X1] :
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f52,plain,
! [X0] :
( complement(sK0(X0),X0)
| ~ test(X0) ),
inference(cnf_transformation,[],[f33]) ).
fof(f54,plain,
! [X0,X1] :
( zero = multiplication(X0,X1)
| ~ complement(X1,X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f56,plain,
! [X0,X1] :
( addition(X0,X1) = one
| ~ complement(X1,X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f58,plain,
! [X0,X1] :
( complement(X0,X1)
| c(X0) != X1
| ~ test(X0) ),
inference(cnf_transformation,[],[f36]) ).
fof(f61,plain,
test(sK4),
inference(cnf_transformation,[],[f38]) ).
fof(f64,plain,
leq(multiplication(multiplication(sK3,sK1),c(sK4)),zero),
inference(cnf_transformation,[],[f38]) ).
fof(f65,plain,
leq(multiplication(multiplication(sK4,sK2),c(sK5)),zero),
inference(cnf_transformation,[],[f38]) ).
fof(f66,plain,
~ leq(multiplication(multiplication(multiplication(sK3,sK1),sK2),c(sK5)),zero),
inference(cnf_transformation,[],[f38]) ).
fof(f67,plain,
! [X0] :
( complement(X0,c(X0))
| ~ test(X0) ),
inference(equality_resolution,[],[f58]) ).
cnf(c_49,plain,
addition(X0,X1) = addition(X1,X0),
inference(cnf_transformation,[],[f39]) ).
cnf(c_50,plain,
addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f40]) ).
cnf(c_51,plain,
addition(X0,zero) = X0,
inference(cnf_transformation,[],[f41]) ).
cnf(c_53,plain,
multiplication(multiplication(X0,X1),X2) = multiplication(X0,multiplication(X1,X2)),
inference(cnf_transformation,[],[f43]) ).
cnf(c_54,plain,
multiplication(X0,one) = X0,
inference(cnf_transformation,[],[f44]) ).
cnf(c_55,plain,
multiplication(one,X0) = X0,
inference(cnf_transformation,[],[f45]) ).
cnf(c_56,plain,
addition(multiplication(X0,X1),multiplication(X0,X2)) = multiplication(X0,addition(X1,X2)),
inference(cnf_transformation,[],[f46]) ).
cnf(c_57,plain,
addition(multiplication(X0,X1),multiplication(X2,X1)) = multiplication(addition(X0,X2),X1),
inference(cnf_transformation,[],[f47]) ).
cnf(c_59,plain,
multiplication(zero,X0) = zero,
inference(cnf_transformation,[],[f49]) ).
cnf(c_60,plain,
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(cnf_transformation,[],[f51]) ).
cnf(c_61,plain,
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(cnf_transformation,[],[f50]) ).
cnf(c_63,plain,
( ~ test(X0)
| complement(sK0(X0),X0) ),
inference(cnf_transformation,[],[f52]) ).
cnf(c_65,plain,
( ~ complement(X0,X1)
| addition(X1,X0) = one ),
inference(cnf_transformation,[],[f56]) ).
cnf(c_67,plain,
( ~ complement(X0,X1)
| multiplication(X1,X0) = zero ),
inference(cnf_transformation,[],[f54]) ).
cnf(c_69,plain,
( ~ test(X0)
| complement(X0,c(X0)) ),
inference(cnf_transformation,[],[f67]) ).
cnf(c_71,negated_conjecture,
~ leq(multiplication(multiplication(multiplication(sK3,sK1),sK2),c(sK5)),zero),
inference(cnf_transformation,[],[f66]) ).
cnf(c_72,negated_conjecture,
leq(multiplication(multiplication(sK4,sK2),c(sK5)),zero),
inference(cnf_transformation,[],[f65]) ).
cnf(c_73,negated_conjecture,
leq(multiplication(multiplication(sK3,sK1),c(sK4)),zero),
inference(cnf_transformation,[],[f64]) ).
cnf(c_76,negated_conjecture,
test(sK4),
inference(cnf_transformation,[],[f61]) ).
cnf(c_94,plain,
( leq(X0,X1)
| addition(X0,X1) != X1 ),
inference(prop_impl_just,[status(thm)],[c_60]) ).
cnf(c_95,plain,
( addition(X0,X1) != X1
| leq(X0,X1) ),
inference(renaming,[status(thm)],[c_94]) ).
cnf(c_96,plain,
( ~ leq(X0,X1)
| addition(X0,X1) = X1 ),
inference(prop_impl_just,[status(thm)],[c_61]) ).
cnf(c_288,plain,
~ leq(multiplication(multiplication(sK3,multiplication(sK1,sK2)),c(sK5)),zero),
inference(demodulation,[status(thm)],[c_71,c_53]) ).
cnf(c_289,plain,
leq(multiplication(sK3,multiplication(sK1,c(sK4))),zero),
inference(demodulation,[status(thm)],[c_73,c_53]) ).
cnf(c_290,plain,
leq(multiplication(sK4,multiplication(sK2,c(sK5))),zero),
inference(demodulation,[status(thm)],[c_72,c_53]) ).
cnf(c_291,plain,
~ leq(multiplication(sK3,multiplication(sK1,multiplication(sK2,c(sK5)))),zero),
inference(demodulation,[status(thm)],[c_288,c_53]) ).
cnf(c_311,plain,
( multiplication(sK3,multiplication(sK1,c(sK4))) != X0
| X1 != zero
| addition(X0,X1) = X1 ),
inference(resolution_lifted,[status(thm)],[c_96,c_289]) ).
cnf(c_312,plain,
addition(multiplication(sK3,multiplication(sK1,c(sK4))),zero) = zero,
inference(unflattening,[status(thm)],[c_311]) ).
cnf(c_316,plain,
( multiplication(sK4,multiplication(sK2,c(sK5))) != X0
| X1 != zero
| addition(X0,X1) = X1 ),
inference(resolution_lifted,[status(thm)],[c_96,c_290]) ).
cnf(c_317,plain,
addition(multiplication(sK4,multiplication(sK2,c(sK5))),zero) = zero,
inference(unflattening,[status(thm)],[c_316]) ).
cnf(c_321,plain,
( multiplication(sK3,multiplication(sK1,multiplication(sK2,c(sK5)))) != X0
| addition(X0,X1) != X1
| X1 != zero ),
inference(resolution_lifted,[status(thm)],[c_95,c_291]) ).
cnf(c_322,plain,
addition(multiplication(sK3,multiplication(sK1,multiplication(sK2,c(sK5)))),zero) != zero,
inference(unflattening,[status(thm)],[c_321]) ).
cnf(c_10091,plain,
addition(zero,X0) = X0,
inference(superposition,[status(thm)],[c_51,c_49]) ).
cnf(c_10130,plain,
( ~ test(X0)
| addition(X0,sK0(X0)) = one ),
inference(superposition,[status(thm)],[c_63,c_65]) ).
cnf(c_10131,plain,
( ~ test(X0)
| addition(c(X0),X0) = one ),
inference(superposition,[status(thm)],[c_69,c_65]) ).
cnf(c_10132,plain,
( ~ test(X0)
| addition(X0,c(X0)) = one ),
inference(theory_normalisation,[status(thm)],[c_10131,c_50,c_49]) ).
cnf(c_10158,plain,
( ~ test(X0)
| multiplication(X0,sK0(X0)) = zero ),
inference(superposition,[status(thm)],[c_63,c_67]) ).
cnf(c_10159,plain,
( ~ test(X0)
| multiplication(c(X0),X0) = zero ),
inference(superposition,[status(thm)],[c_69,c_67]) ).
cnf(c_10213,plain,
addition(sK4,sK0(sK4)) = one,
inference(superposition,[status(thm)],[c_76,c_10130]) ).
cnf(c_10329,plain,
addition(multiplication(X0,sK4),multiplication(X0,sK0(sK4))) = multiplication(X0,one),
inference(superposition,[status(thm)],[c_10213,c_56]) ).
cnf(c_10333,plain,
addition(multiplication(X0,sK4),multiplication(X0,sK0(sK4))) = X0,
inference(light_normalisation,[status(thm)],[c_10329,c_54]) ).
cnf(c_10357,plain,
multiplication(sK4,sK0(sK4)) = zero,
inference(superposition,[status(thm)],[c_76,c_10158]) ).
cnf(c_10370,plain,
multiplication(c(sK4),sK4) = zero,
inference(superposition,[status(thm)],[c_76,c_10159]) ).
cnf(c_10867,plain,
addition(zero,multiplication(c(sK4),sK0(sK4))) = c(sK4),
inference(superposition,[status(thm)],[c_10370,c_10333]) ).
cnf(c_10965,plain,
multiplication(c(sK4),sK0(sK4)) = c(sK4),
inference(demodulation,[status(thm)],[c_10867,c_10091]) ).
cnf(c_30343,plain,
addition(sK4,c(sK4)) = one,
inference(superposition,[status(thm)],[c_76,c_10132]) ).
cnf(c_31897,plain,
addition(multiplication(sK4,X0),multiplication(c(sK4),X0)) = multiplication(one,X0),
inference(superposition,[status(thm)],[c_30343,c_57]) ).
cnf(c_31899,plain,
addition(multiplication(sK4,X0),multiplication(c(sK4),X0)) = X0,
inference(light_normalisation,[status(thm)],[c_31897,c_55]) ).
cnf(c_37636,plain,
addition(multiplication(sK4,sK0(sK4)),c(sK4)) = sK0(sK4),
inference(superposition,[status(thm)],[c_10965,c_31899]) ).
cnf(c_37645,plain,
addition(c(sK4),multiplication(sK4,sK0(sK4))) = sK0(sK4),
inference(theory_normalisation,[status(thm)],[c_37636,c_50,c_49]) ).
cnf(c_37646,plain,
addition(c(sK4),zero) = sK0(sK4),
inference(light_normalisation,[status(thm)],[c_37645,c_10357]) ).
cnf(c_37647,plain,
addition(zero,c(sK4)) = sK0(sK4),
inference(theory_normalisation,[status(thm)],[c_37646,c_50,c_49]) ).
cnf(c_166993,plain,
addition(zero,multiplication(sK3,multiplication(sK1,c(sK4)))) = zero,
inference(theory_normalisation,[status(thm)],[c_312,c_50,c_49]) ).
cnf(c_166994,plain,
addition(zero,multiplication(sK4,multiplication(sK2,c(sK5)))) = zero,
inference(theory_normalisation,[status(thm)],[c_317,c_50,c_49]) ).
cnf(c_166995,plain,
addition(zero,multiplication(sK3,multiplication(sK1,multiplication(sK2,c(sK5))))) != zero,
inference(theory_normalisation,[status(thm)],[c_322,c_50,c_49]) ).
cnf(c_166997,plain,
addition(zero,X0) = X0,
inference(superposition,[status(thm)],[c_51,c_49]) ).
cnf(c_167001,plain,
sK0(sK4) = c(sK4),
inference(demodulation,[status(thm)],[c_37647,c_166997]) ).
cnf(c_167002,plain,
multiplication(sK3,multiplication(sK1,c(sK4))) = zero,
inference(demodulation,[status(thm)],[c_166993,c_166997]) ).
cnf(c_167003,plain,
multiplication(sK4,multiplication(sK2,c(sK5))) = zero,
inference(demodulation,[status(thm)],[c_166994,c_166997]) ).
cnf(c_167004,plain,
multiplication(sK3,multiplication(sK1,multiplication(sK2,c(sK5)))) != zero,
inference(demodulation,[status(thm)],[c_166995,c_166997]) ).
cnf(c_167031,plain,
( ~ test(sK4)
| complement(c(sK4),sK4) ),
inference(superposition,[status(thm)],[c_167001,c_63]) ).
cnf(c_167033,plain,
complement(c(sK4),sK4),
inference(forward_subsumption_resolution,[status(thm)],[c_167031,c_76]) ).
cnf(c_167073,plain,
addition(sK4,c(sK4)) = one,
inference(superposition,[status(thm)],[c_167033,c_65]) ).
cnf(c_167173,plain,
multiplication(sK3,multiplication(multiplication(sK1,c(sK4)),X0)) = multiplication(zero,X0),
inference(superposition,[status(thm)],[c_167002,c_53]) ).
cnf(c_167179,plain,
multiplication(sK3,multiplication(multiplication(sK1,c(sK4)),X0)) = zero,
inference(light_normalisation,[status(thm)],[c_167173,c_59]) ).
cnf(c_167323,plain,
addition(multiplication(sK4,X0),multiplication(c(sK4),X0)) = multiplication(one,X0),
inference(superposition,[status(thm)],[c_167073,c_57]) ).
cnf(c_167354,plain,
addition(multiplication(sK4,X0),multiplication(c(sK4),X0)) = X0,
inference(light_normalisation,[status(thm)],[c_167323,c_55]) ).
cnf(c_167552,plain,
addition(zero,multiplication(c(sK4),multiplication(sK2,c(sK5)))) = multiplication(sK2,c(sK5)),
inference(superposition,[status(thm)],[c_167003,c_167354]) ).
cnf(c_172547,plain,
multiplication(sK3,multiplication(sK1,multiplication(c(sK4),X0))) = zero,
inference(demodulation,[status(thm)],[c_167179,c_53]) ).
cnf(c_232644,plain,
multiplication(c(sK4),multiplication(sK2,c(sK5))) = multiplication(sK2,c(sK5)),
inference(demodulation,[status(thm)],[c_167552,c_166997]) ).
cnf(c_232655,plain,
multiplication(sK3,multiplication(sK1,multiplication(sK2,c(sK5)))) = zero,
inference(superposition,[status(thm)],[c_232644,c_172547]) ).
cnf(c_232663,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_232655,c_167004]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : KLE034+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 11:59:48 EDT 2023
% 0.13/0.35 % 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
% 53.31/8.26 % SZS status Started for theBenchmark.p
% 53.31/8.26 % SZS status Theorem for theBenchmark.p
% 53.31/8.26
% 53.31/8.26 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 53.31/8.26
% 53.31/8.26 ------ iProver source info
% 53.31/8.26
% 53.31/8.26 git: date: 2023-05-31 18:12:56 +0000
% 53.31/8.26 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 53.31/8.26 git: non_committed_changes: false
% 53.31/8.26 git: last_make_outside_of_git: false
% 53.31/8.26
% 53.31/8.26 ------ Parsing...
% 53.31/8.26 ------ Clausification by vclausify_rel & Parsing by iProver...
% 53.31/8.26
% 53.31/8.26 ------ Preprocessing... sup_sim: 4 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e
% 53.31/8.26
% 53.31/8.26 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 53.31/8.26
% 53.31/8.26 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 53.31/8.26 ------ Proving...
% 53.31/8.26 ------ Problem Properties
% 53.31/8.26
% 53.31/8.26
% 53.31/8.26 clauses 28
% 53.31/8.26 conjectures 3
% 53.31/8.26 EPR 4
% 53.31/8.26 Horn 27
% 53.31/8.26 unary 17
% 53.31/8.26 binary 9
% 53.31/8.26 lits 42
% 53.31/8.26 lits eq 26
% 53.31/8.26 fd_pure 0
% 53.31/8.26 fd_pseudo 0
% 53.31/8.26 fd_cond 0
% 53.31/8.26 fd_pseudo_cond 1
% 53.31/8.26 AC symbols 1
% 53.31/8.26
% 53.31/8.26 ------ Schedule dynamic 5 is on
% 53.31/8.26
% 53.31/8.26 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 53.31/8.26
% 53.31/8.26
% 53.31/8.26 ------
% 53.31/8.26 Current options:
% 53.31/8.26 ------
% 53.31/8.26
% 53.31/8.26
% 53.31/8.26
% 53.31/8.26
% 53.31/8.26 ------ Proving...
% 53.31/8.26
% 53.31/8.26
% 53.31/8.26 % SZS status Theorem for theBenchmark.p
% 53.31/8.26
% 53.31/8.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 53.31/8.26
% 53.31/8.26
%------------------------------------------------------------------------------