↑ Up

lazyCoP---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : LCL678+1.001 : TPTP v9.3.1. Released v4.0.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   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 12:29:09 PM UTC 2026

% Result   : Theorem 0.09s 0.37s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL678+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.09/0.36  % Computer : n008.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sat Sep  5 23:57:23 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.37  % SZS status Theorem
% 0.09/0.37  % SZS output begin IncompleteProof
% 0.09/0.37  cnf(c0, axiom,
% 0.09/0.37  	sP1(X0) | ~r1(sK4,X0)).
% 0.09/0.37  cnf(c1, plain,
% 0.09/0.37  	sP1(X0) | ~r1(sK4,X0),
% 0.09/0.37  	inference(start, [], [c0])).
% 0.09/0.37  
% 0.09/0.37  cnf(c2, axiom,
% 0.09/0.37  	sP0(sK2(X1)) | ~sP1(X1)).
% 0.09/0.37  cnf(a0, assumption,
% 0.09/0.37  	X0 = X1).
% 0.09/0.37  cnf(c3, plain,
% 0.09/0.37  	~r1(sK4,X0),
% 0.09/0.37  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.09/0.37  cnf(c4, plain,
% 0.09/0.37  	sP0(sK2(X1)),
% 0.09/0.37  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.09/0.37  
% 0.09/0.37  cnf(c5, axiom,
% 0.09/0.37  	r1(X2,sK3(X2)) | ~sP0(X2)).
% 0.09/0.37  cnf(a1, assumption,
% 0.09/0.37  	sK2(X1) = X2).
% 0.09/0.37  cnf(c6, plain,
% 0.09/0.37  	$false,
% 0.09/0.37  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.09/0.37  cnf(c7, plain,
% 0.09/0.37  	r1(X2,sK3(X2)),
% 0.09/0.37  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.09/0.37  
% 0.09/0.37  cnf(c8, axiom,
% 0.09/0.37  	p1(X3) | ~r1(sK2(X4),X3) | ~sP1(X4)).
% 0.09/0.37  cnf(a2, assumption,
% 0.09/0.37  	X2 = sK2(X4)).
% 0.09/0.37  cnf(a3, assumption,
% 0.09/0.37  	sK3(X2) = X3).
% 0.09/0.37  cnf(c9, plain,
% 0.09/0.37  	$false,
% 0.09/0.37  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c7, c8])).
% 0.09/0.37  cnf(c10, plain,
% 0.09/0.37  	p1(X3) | ~sP1(X4),
% 0.09/0.37  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c7, c8])).
% 0.09/0.37  
% 0.09/0.37  cnf(c11, axiom,
% 0.09/0.37  	~p1(sK3(X5)) | ~sP0(X5)).
% 0.09/0.37  cnf(a4, assumption,
% 0.09/0.37  	X3 = sK3(X5)).
% 0.09/0.37  cnf(c12, plain,
% 0.09/0.37  	~sP1(X4),
% 0.09/0.37  	inference(strict_predicate_extension, [assumptions([a4])], [c10, c11])).
% 0.09/0.37  cnf(c13, plain,
% 0.09/0.37  	~sP0(X5),
% 0.09/0.37  	inference(strict_predicate_extension, [assumptions([a4])], [c10, c11])).
% 0.09/0.37  
% 0.09/0.37  cnf(c14, plain,
% 0.09/0.37  	sP0(sK2(X1))).
% 0.09/0.37  cnf(a5, assumption,
% 0.09/0.37  	X5 = sK2(X1)).
% 0.09/0.37  cnf(c15, plain,
% 0.09/0.37  	$false,
% 0.09/0.37  	inference(predicate_reduction, [assumptions([a5])], [c13, c14])).
% 0.09/0.37  
% 0.09/0.37  cnf(c16, plain,
% 0.09/0.37  	sP1(X0)).
% 0.09/0.37  cnf(a6, assumption,
% 0.09/0.37  	X4 = X0).
% 0.09/0.37  cnf(c17, plain,
% 0.09/0.37  	$false,
% 0.09/0.37  	inference(predicate_reduction, [assumptions([a6])], [c12, c16])).
% 0.09/0.37  
% 0.09/0.37  cnf(c18, axiom,
% 0.09/0.37  	r1(X6,X6)).
% 0.09/0.37  cnf(a7, assumption,
% 0.09/0.37  	sK4 = X6).
% 0.09/0.37  cnf(a8, assumption,
% 0.09/0.37  	X0 = X6).
% 0.09/0.37  cnf(c19, plain,
% 0.09/0.37  	$false,
% 0.09/0.37  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c3, c18])).
% 0.09/0.37  cnf(c20, plain,
% 0.09/0.37  	$false,
% 0.09/0.37  	inference(strict_predicate_extension, [assumptions([a7, a8])], [c3, c18])).
% 0.09/0.37  
% 0.09/0.37  cnf(c21, plain,
% 0.09/0.37  	$false,
% 0.09/0.37  	inference(constraint_solving, [
% 0.09/0.37  		bind(X0, sK4),
% 0.09/0.37  		bind(X1, sK4),
% 0.09/0.37  		bind(X2, sK2(X1)),
% 0.09/0.37  		bind(X3, sK3(X2)),
% 0.09/0.37  		bind(X4, sK4),
% 0.09/0.37  		bind(X5, sK2(X1)),
% 0.09/0.37  		bind(X6, sK4)
% 0.09/0.37  	],
% 0.09/0.37  	[a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 0.09/0.37  
% 0.09/0.37  % SZS output end IncompleteProof
%------------------------------------------------------------------------------