%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUM925+6 : TPTP v8.1.0. Released v5.3.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n008.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 : Mon Jul 18 11:37:46 EDT 2022 % Result : Theorem 3.60s 0.87s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : NUM925+6 : TPTP v8.1.0. Released v5.3.0. % 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.34 % Computer : n008.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Thu Jul 7 09:32:08 EDT 2022 % 0.12/0.34 % CPUTime : % 3.60/0.87 % SZS status Theorem % 3.60/0.87 % SZS output begin IncompleteProof % 3.60/0.87 cnf(c0, axiom, % 3.60/0.87 zero_zero(int) = hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))). % 3.60/0.87 cnf(c1, plain, % 3.60/0.87 zero_zero(int) = hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls)))), % 3.60/0.87 inference(start, [], [c0])). % 3.60/0.87 % 3.60/0.87 cnf(c2, axiom, % 3.60/0.87 hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X0),hAPP(nat,int,power_power(int,X0),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))))). % 3.60/0.87 cnf(a0, assumption, % 3.60/0.87 hAPP(nat,int,power_power(int,X0),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls)))) = hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))). % 3.60/0.87 cnf(a1, assumption, % 3.60/0.87 zero_zero(int) = X1). % 3.60/0.87 cnf(c3, plain, % 3.60/0.87 $false, % 3.60/0.87 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 3.60/0.87 cnf(c4, plain, % 3.60/0.87 $false, % 3.60/0.87 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 3.60/0.87 cnf(c5, plain, % 3.60/0.87 hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X0),X1)), % 3.60/0.87 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 3.60/0.87 % 3.60/0.87 cnf(c6, axiom, % 3.60/0.87 ~hBOOL(hAPP(X2,bool,hAPP(X2,fun(X2,bool),ord_less(X2),X3),X4)) | ~hBOOL(hAPP(X2,bool,hAPP(X2,fun(X2,bool),ord_less_eq(X2),X4),X3)) | ~linorder(X2)). % 3.60/0.87 cnf(a2, assumption, % 3.60/0.87 hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X0),X1) = hAPP(X2,bool,hAPP(X2,fun(X2,bool),ord_less_eq(X2),X4),X3)). % 3.60/0.87 cnf(c7, plain, % 3.60/0.87 $false, % 3.60/0.87 inference(strict_predicate_extension, [assumptions([a2])], [c5, c6])). % 3.60/0.87 cnf(c8, plain, % 3.60/0.87 ~hBOOL(hAPP(X2,bool,hAPP(X2,fun(X2,bool),ord_less(X2),X3),X4)) | ~linorder(X2), % 3.60/0.87 inference(strict_predicate_extension, [assumptions([a2])], [c5, c6])). % 3.60/0.87 % 3.60/0.87 cnf(c9, axiom, % 3.60/0.87 hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))))). % 3.60/0.87 cnf(a3, assumption, % 3.60/0.87 hAPP(X2,bool,hAPP(X2,fun(X2,bool),ord_less(X2),X3),X4) = hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n)))). % 3.60/0.87 cnf(c10, plain, % 3.60/0.87 ~linorder(X2), % 3.60/0.87 inference(strict_predicate_extension, [assumptions([a3])], [c8, c9])). % 3.60/0.87 cnf(c11, plain, % 3.60/0.87 $false, % 3.60/0.87 inference(strict_predicate_extension, [assumptions([a3])], [c8, c9])). % 3.60/0.87 % 3.60/0.87 cnf(c12, axiom, % 3.60/0.87 linorder(int)). % 3.60/0.87 cnf(a4, assumption, % 3.60/0.87 X2 = int). % 3.60/0.87 cnf(c13, plain, % 3.60/0.87 $false, % 3.60/0.87 inference(strict_predicate_extension, [assumptions([a4])], [c10, c12])). % 3.60/0.87 cnf(c14, plain, % 3.60/0.87 $false, % 3.60/0.87 inference(strict_predicate_extension, [assumptions([a4])], [c10, c12])). % 3.60/0.87 % 3.60/0.87 cnf(c15, plain, % 3.60/0.87 $false, % 3.60/0.87 inference(constraint_solving, [ % 3.60/0.87 bind(X0, hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))), % 3.60/0.87 bind(X1, zero_zero(int)), % 3.60/0.87 bind(X2, int), % 3.60/0.87 bind(X3, zero_zero(int)), % 3.60/0.87 bind(X4, hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))) % 3.60/0.87 ], % 3.60/0.87 [a0, a1, a2, a3, a4])). % 3.60/0.87 % 3.60/0.87 % SZS output end IncompleteProof %------------------------------------------------------------------------------