↑ Up

lazyCoP---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : NUM925+2 : 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 : n003.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:43 EDT 2022

% Result   : Theorem 22.85s 3.39s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM925+2 : 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.13/0.34  % Computer : n003.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Wed Jul  6 19:17:56 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 22.85/3.39  % SZS status Theorem
% 22.85/3.39  % SZS output begin IncompleteProof
% 22.85/3.39  cnf(c0, axiom,
% 22.85/3.39  	pls = hAPP_nat_int(power_power_int(hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(one_one_int),pls)),pls)),hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(one_one_int),pls)),pls))))).
% 22.85/3.39  cnf(c1, plain,
% 22.85/3.39  	pls = hAPP_nat_int(power_power_int(hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(one_one_int),pls)),pls)),hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(one_one_int),pls)),pls)))),
% 22.85/3.39  	inference(start, [], [c0])).
% 22.85/3.39  
% 22.85/3.39  cnf(c2, axiom,
% 22.85/3.39  	hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,one_one_int),hAPP_nat_int(power_power_int(X0),X1))) | ~hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,one_one_int),X0))).
% 22.85/3.39  cnf(a0, assumption,
% 22.85/3.39  	hAPP_nat_int(power_power_int(X0),X1) = hAPP_nat_int(power_power_int(hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(one_one_int),pls)),pls)),hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(one_one_int),pls)),pls))))).
% 22.85/3.39  cnf(a1, assumption,
% 22.85/3.39  	pls = X2).
% 22.85/3.39  cnf(c3, plain,
% 22.85/3.39  	$false,
% 22.85/3.39  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 22.85/3.39  cnf(c4, plain,
% 22.85/3.39  	~hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,one_one_int),X0)),
% 22.85/3.39  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 22.85/3.39  cnf(c5, plain,
% 22.85/3.39  	hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,one_one_int),X2)),
% 22.85/3.39  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 22.85/3.39  
% 22.85/3.39  cnf(c6, axiom,
% 22.85/3.39  	~hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,one_one_int),pls))).
% 22.85/3.39  cnf(a2, assumption,
% 22.85/3.39  	hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,one_one_int),X2) = hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,one_one_int),pls)).
% 22.85/3.39  cnf(c7, plain,
% 22.85/3.39  	$false,
% 22.85/3.39  	inference(strict_predicate_extension, [assumptions([a2])], [c5, c6])).
% 22.85/3.39  cnf(c8, plain,
% 22.85/3.39  	$false,
% 22.85/3.39  	inference(strict_predicate_extension, [assumptions([a2])], [c5, c6])).
% 22.85/3.39  
% 22.85/3.39  cnf(c9, axiom,
% 22.85/3.39  	hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,X3),hAPP_int_int(plus_plus_int(X3),hAPP_nat_int(semiri1621563631at_int,X4))))).
% 22.85/3.39  cnf(a3, assumption,
% 22.85/3.39  	hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,one_one_int),X0) = hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,X3),hAPP_int_int(plus_plus_int(X3),hAPP_nat_int(semiri1621563631at_int,X4)))).
% 22.85/3.39  cnf(c10, plain,
% 22.85/3.39  	$false,
% 22.85/3.39  	inference(strict_predicate_extension, [assumptions([a3])], [c4, c9])).
% 22.85/3.39  cnf(c11, plain,
% 22.85/3.39  	$false,
% 22.85/3.39  	inference(strict_predicate_extension, [assumptions([a3])], [c4, c9])).
% 22.85/3.39  
% 22.85/3.39  cnf(c12, plain,
% 22.85/3.39  	$false,
% 22.85/3.39  	inference(constraint_solving, [
% 22.85/3.39  		bind(X0, hAPP_int_int(plus_plus_int(one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),
% 22.85/3.39  		bind(X1, number_number_of_nat(hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(one_one_int),pls)),pls)),hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(one_one_int),pls)),pls)))),
% 22.85/3.39  		bind(X2, pls),
% 22.85/3.39  		bind(X3, one_one_int),
% 22.85/3.39  		bind(X4, n)
% 22.85/3.39  	],
% 22.85/3.39  	[a0, a1, a2, a3])).
% 22.85/3.39  
% 22.85/3.39  % SZS output end IncompleteProof
%------------------------------------------------------------------------------