↑ Up

lazyCoP---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : CSR073+5 : TPTP v8.1.0. Bugfixed v3.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n028.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 : Fri Jul 15 20:36:49 EDT 2022

% Result   : Theorem 9.05s 8.19s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : CSR073+5 : TPTP v8.1.0. Bugfixed v3.5.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.33  % Computer : n028.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % 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 : Sat Jun 11 05:53:20 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 9.05/8.19  % SZS status Theorem
% 9.05/8.19  % SZS output begin IncompleteProof
% 9.05/8.19  cnf(c0, axiom,
% 9.05/8.19  	~tptptypes_5_387(X0,c_pushingababycarriage)).
% 9.05/8.19  cnf(c1, plain,
% 9.05/8.19  	~tptptypes_5_387(X0,c_pushingababycarriage),
% 9.05/8.19  	inference(start, [], [c0])).
% 9.05/8.19  
% 9.05/8.19  cnf(c2, axiom,
% 9.05/8.19  	tptptypes_5_387(X1,X2) | ~tptptypes_6_388(X1,X2)).
% 9.05/8.19  cnf(a0, assumption,
% 9.05/8.19  	X0 = X1).
% 9.05/8.19  cnf(a1, assumption,
% 9.05/8.19  	c_pushingababycarriage = X2).
% 9.05/8.19  cnf(c3, plain,
% 9.05/8.19  	$false,
% 9.05/8.19  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 9.05/8.19  cnf(c4, plain,
% 9.05/8.19  	~tptptypes_6_388(X1,X2),
% 9.05/8.19  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 9.05/8.19  
% 9.05/8.19  cnf(c5, axiom,
% 9.05/8.19  	tptptypes_6_388(X3,X4) | ~tptptypes_7_396(X3,X4)).
% 9.05/8.19  cnf(a2, assumption,
% 9.05/8.19  	X1 = X3).
% 9.05/8.19  cnf(a3, assumption,
% 9.05/8.19  	X2 = X4).
% 9.05/8.19  cnf(c6, plain,
% 9.05/8.19  	$false,
% 9.05/8.19  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 9.05/8.19  cnf(c7, plain,
% 9.05/8.19  	~tptptypes_7_396(X3,X4),
% 9.05/8.19  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 9.05/8.19  
% 9.05/8.19  cnf(c8, axiom,
% 9.05/8.19  	tptptypes_7_396(c_tptpcol_16_13522,c_pushingababycarriage)).
% 9.05/8.19  cnf(a4, assumption,
% 9.05/8.19  	X3 = c_tptpcol_16_13522).
% 9.05/8.19  cnf(a5, assumption,
% 9.05/8.19  	X4 = c_pushingababycarriage).
% 9.05/8.19  cnf(c9, plain,
% 9.05/8.19  	$false,
% 9.05/8.19  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 9.05/8.19  cnf(c10, plain,
% 9.05/8.19  	$false,
% 9.05/8.19  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 9.05/8.19  
% 9.05/8.19  cnf(c11, plain,
% 9.05/8.19  	$false,
% 9.05/8.19  	inference(constraint_solving, [
% 9.05/8.19  		bind(X0, c_tptpcol_16_13522),
% 9.05/8.19  		bind(X1, c_tptpcol_16_13522),
% 9.05/8.19  		bind(X2, c_pushingababycarriage),
% 9.05/8.19  		bind(X3, c_tptpcol_16_13522),
% 9.05/8.19  		bind(X4, c_pushingababycarriage)
% 9.05/8.19  	],
% 9.05/8.19  	[a0, a1, a2, a3, a4, a5])).
% 9.05/8.19  
% 9.05/8.19  % SZS output end IncompleteProof
%------------------------------------------------------------------------------