TSTP Solution File: NUM925+4 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : NUM925+4 : 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 : n011.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:45 EDT 2022

% Result   : Theorem 50.26s 7.67s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : NUM925+4 : TPTP v8.1.0. Released v5.3.0.
% 0.12/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.34  % Computer : n011.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 13:12:09 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 50.26/7.67  % SZS status Theorem
% 50.26/7.67  % SZS output begin IncompleteProof
% 50.26/7.67  cnf(c0, axiom,
% 50.26/7.67  	pls = hAPP_nat_int(hAPP_int_fun_nat_int(power_power_int,hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit0,hAPP_int_int(bit1,pls))))).
% 50.26/7.67  cnf(c1, plain,
% 50.26/7.67  	pls = hAPP_nat_int(hAPP_int_fun_nat_int(power_power_int,hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit0,hAPP_int_int(bit1,pls)))),
% 50.26/7.67  	inference(start, [], [c0])).
% 50.26/7.67  
% 50.26/7.67  cnf(c2, axiom,
% 50.26/7.67  	hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,X0),hAPP_nat_int(hAPP_int_fun_nat_int(power_power_int,X0),hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit0,hAPP_int_int(bit1,pls))))))).
% 50.26/7.67  cnf(a0, assumption,
% 50.26/7.67  	hAPP_nat_int(hAPP_int_fun_nat_int(power_power_int,X0),hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit0,hAPP_int_int(bit1,pls)))) = hAPP_nat_int(hAPP_int_fun_nat_int(power_power_int,hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit0,hAPP_int_int(bit1,pls))))).
% 50.26/7.67  cnf(a1, assumption,
% 50.26/7.67  	pls = X1).
% 50.26/7.67  cnf(c3, plain,
% 50.26/7.67  	$false,
% 50.26/7.67  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 50.26/7.67  cnf(c4, plain,
% 50.26/7.67  	$false,
% 50.26/7.67  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 50.26/7.67  cnf(c5, plain,
% 50.26/7.67  	hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,X0),X1)),
% 50.26/7.67  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 50.26/7.67  
% 50.26/7.67  cnf(c6, axiom,
% 50.26/7.67  	~hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,X2),X3)) | ~hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,X3),X2))).
% 50.26/7.67  cnf(a2, assumption,
% 50.26/7.67  	hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,X0),X1) = hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,X3),X2)).
% 50.26/7.67  cnf(c7, plain,
% 50.26/7.67  	$false,
% 50.26/7.67  	inference(strict_predicate_extension, [assumptions([a2])], [c5, c6])).
% 50.26/7.67  cnf(c8, plain,
% 50.26/7.67  	~hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,X2),X3)),
% 50.26/7.67  	inference(strict_predicate_extension, [assumptions([a2])], [c5, c6])).
% 50.26/7.67  
% 50.26/7.67  cnf(c9, axiom,
% 50.26/7.67  	hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,n))))).
% 50.26/7.67  cnf(a3, assumption,
% 50.26/7.67  	hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,X2),X3) = hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,n)))).
% 50.26/7.67  cnf(c10, plain,
% 50.26/7.67  	$false,
% 50.26/7.67  	inference(strict_predicate_extension, [assumptions([a3])], [c8, c9])).
% 50.26/7.67  cnf(c11, plain,
% 50.26/7.67  	$false,
% 50.26/7.67  	inference(strict_predicate_extension, [assumptions([a3])], [c8, c9])).
% 50.26/7.67  
% 50.26/7.67  cnf(c12, plain,
% 50.26/7.67  	$false,
% 50.26/7.67  	inference(constraint_solving, [
% 50.26/7.67  		bind(X0, hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),
% 50.26/7.67  		bind(X1, pls),
% 50.26/7.67  		bind(X2, pls),
% 50.26/7.67  		bind(X3, hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,n)))
% 50.26/7.67  	],
% 50.26/7.67  	[a0, a1, a2, a3])).
% 50.26/7.67  
% 50.26/7.67  % SZS output end IncompleteProof
%------------------------------------------------------------------------------