↑ Up

lazyCoP---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SEV668+1 : TPTP v9.3.0. Released v9.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 : n021.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 : Tue May  5 06:53:10 PM UTC 2026

% Result   : Theorem 8.56s 1.92s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14  % Problem  : SEV668+1 : TPTP v9.3.0. Released v9.3.0.
% 0.11/0.15  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.15/0.36  % Computer : n021.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Tue May  5 08:03:55 EDT 2026
% 0.15/0.37  % CPUTime  : 
% 8.56/1.92  % SZS status Theorem
% 8.56/1.92  % SZS output begin IncompleteProof
% 8.56/1.92  cnf(c0, axiom,
% 8.56/1.92  	cRedblack_2eTREES_2eempty__tree = happ(happ(happ(happ(happ(cRedblack_2eTREES_2eT,sK2875),sK2876),sK2877),sK2878),sK2879)).
% 8.56/1.92  cnf(c1, plain,
% 8.56/1.92  	cRedblack_2eTREES_2eempty__tree = happ(happ(happ(happ(happ(cRedblack_2eTREES_2eT,sK2875),sK2876),sK2877),sK2878),sK2879),
% 8.56/1.92  	inference(start, [], [c0])).
% 8.56/1.92  
% 8.56/1.92  cnf(c2, axiom,
% 8.56/1.92  	cRedblack_2eTREES_2eempty__tree != happ(happ(happ(happ(happ(cRedblack_2eTREES_2eT,X0),X1),X2),X3),X4)).
% 8.56/1.92  cnf(a0, assumption,
% 8.56/1.92  	happ(happ(happ(happ(happ(cRedblack_2eTREES_2eT,X0),X1),X2),X3),X4) = happ(happ(happ(happ(happ(cRedblack_2eTREES_2eT,sK2875),sK2876),sK2877),sK2878),sK2879)).
% 8.56/1.92  cnf(a1, assumption,
% 8.56/1.92  	cRedblack_2eTREES_2eempty__tree = X5).
% 8.56/1.92  cnf(c3, plain,
% 8.56/1.92  	$false,
% 8.56/1.92  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 8.56/1.92  cnf(c4, plain,
% 8.56/1.92  	$false,
% 8.56/1.92  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 8.56/1.92  cnf(c5, plain,
% 8.56/1.92  	cRedblack_2eTREES_2eempty__tree != X5,
% 8.56/1.92  	inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])).
% 8.56/1.92  
% 8.56/1.92  cnf(a2, assumption,
% 8.56/1.92  	cRedblack_2eTREES_2eempty__tree = X5).
% 8.56/1.92  cnf(c6, plain,
% 8.56/1.92  	$false,
% 8.56/1.92  	inference(reflexivity, [assumptions([a2])], [c5])).
% 8.56/1.92  
% 8.56/1.92  cnf(c7, plain,
% 8.56/1.92  	$false,
% 8.56/1.92  	inference(constraint_solving, [
% 8.56/1.92  		bind(X0, sK2875),
% 8.56/1.92  		bind(X1, sK2876),
% 8.56/1.92  		bind(X2, sK2877),
% 8.56/1.92  		bind(X3, sK2878),
% 8.56/1.92  		bind(X4, sK2879),
% 8.56/1.92  		bind(X5, cRedblack_2eTREES_2eempty__tree)
% 8.56/1.92  	],
% 8.56/1.92  	[a0, a1, a2])).
% 8.56/1.92  
% 8.56/1.92  % SZS output end IncompleteProof
%------------------------------------------------------------------------------