↑ Up

lazyCoP---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : LCL656+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 : n006.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:02 PM UTC 2026

% Result   : Theorem 0.08s 0.38s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL656+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.08/0.36  % Computer : n006.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Sat Sep  5 02:15:16 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.38  % SZS status Theorem
% 0.08/0.38  % SZS output begin IncompleteProof
% 0.08/0.38  cnf(c0, axiom,
% 0.08/0.38  	~p101(sK8)).
% 0.08/0.38  cnf(c1, plain,
% 0.08/0.38  	~p101(sK8),
% 0.08/0.38  	inference(start, [], [c0])).
% 0.08/0.38  
% 0.08/0.38  cnf(c2, axiom,
% 0.08/0.38  	~p100(X0) | p101(X0) | sP0(X0) | ~sP2(X0)).
% 0.08/0.38  cnf(a0, assumption,
% 0.08/0.38  	sK8 = X0).
% 0.08/0.38  cnf(c3, plain,
% 0.08/0.38  	$false,
% 0.08/0.38  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.08/0.38  cnf(c4, plain,
% 0.08/0.38  	~p100(X0) | sP0(X0) | ~sP2(X0),
% 0.08/0.38  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.08/0.38  
% 0.08/0.38  cnf(c5, axiom,
% 0.08/0.38  	p100(sK8)).
% 0.08/0.38  cnf(a1, assumption,
% 0.08/0.38  	X0 = sK8).
% 0.08/0.38  cnf(c6, plain,
% 0.08/0.38  	sP0(X0) | ~sP2(X0),
% 0.08/0.38  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.08/0.38  cnf(c7, plain,
% 0.08/0.38  	$false,
% 0.08/0.38  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.08/0.38  
% 0.08/0.38  cnf(c8, axiom,
% 0.08/0.38  	r1(X1,sK7(X1)) | ~sP0(X1)).
% 0.08/0.38  cnf(a2, assumption,
% 0.08/0.38  	X0 = X1).
% 0.08/0.38  cnf(c9, plain,
% 0.08/0.38  	~sP2(X0),
% 0.08/0.38  	inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])).
% 0.08/0.38  cnf(c10, plain,
% 0.08/0.38  	r1(X1,sK7(X1)),
% 0.08/0.38  	inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])).
% 0.08/0.38  
% 0.08/0.38  cnf(c11, axiom,
% 0.08/0.38  	p2(X2) | ~r1(sK8,X2)).
% 0.08/0.38  cnf(a3, assumption,
% 0.08/0.38  	X1 = sK8).
% 0.08/0.38  cnf(a4, assumption,
% 0.08/0.38  	sK7(X1) = X2).
% 0.08/0.38  cnf(c12, plain,
% 0.08/0.38  	$false,
% 0.08/0.38  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c10, c11])).
% 0.08/0.38  cnf(c13, plain,
% 0.08/0.38  	p2(X2),
% 0.08/0.38  	inference(strict_predicate_extension, [assumptions([a3, a4])], [c10, c11])).
% 0.08/0.38  
% 0.08/0.38  cnf(c14, axiom,
% 0.08/0.38  	~p2(sK7(X3)) | ~sP0(X3)).
% 0.08/0.38  cnf(a5, assumption,
% 0.08/0.38  	X2 = sK7(X3)).
% 0.08/0.38  cnf(c15, plain,
% 0.08/0.38  	$false,
% 0.08/0.38  	inference(strict_predicate_extension, [assumptions([a5])], [c13, c14])).
% 0.08/0.38  cnf(c16, plain,
% 0.08/0.38  	~sP0(X3),
% 0.08/0.38  	inference(strict_predicate_extension, [assumptions([a5])], [c13, c14])).
% 0.08/0.38  
% 0.08/0.38  cnf(c17, plain,
% 0.08/0.38  	sP0(X0)).
% 0.08/0.38  cnf(a6, assumption,
% 0.08/0.38  	X3 = X0).
% 0.08/0.38  cnf(c18, plain,
% 0.08/0.38  	$false,
% 0.08/0.38  	inference(predicate_reduction, [assumptions([a6])], [c16, c17])).
% 0.08/0.38  
% 0.08/0.38  cnf(c19, axiom,
% 0.08/0.38  	sP2(X4) | ~sP5(X4)).
% 0.08/0.38  cnf(a7, assumption,
% 0.08/0.38  	X0 = X4).
% 0.08/0.38  cnf(c20, plain,
% 0.08/0.38  	$false,
% 0.08/0.38  	inference(strict_predicate_extension, [assumptions([a7])], [c9, c19])).
% 0.08/0.38  cnf(c21, plain,
% 0.08/0.38  	~sP5(X4),
% 0.08/0.38  	inference(strict_predicate_extension, [assumptions([a7])], [c9, c19])).
% 0.08/0.38  
% 0.08/0.38  cnf(c22, axiom,
% 0.08/0.38  	sP5(X5) | ~r1(sK8,X5)).
% 0.08/0.38  cnf(a8, assumption,
% 0.08/0.38  	X4 = X5).
% 0.08/0.38  cnf(c23, plain,
% 0.08/0.38  	$false,
% 0.08/0.38  	inference(strict_predicate_extension, [assumptions([a8])], [c21, c22])).
% 0.08/0.38  cnf(c24, plain,
% 0.08/0.38  	~r1(sK8,X5),
% 0.08/0.38  	inference(strict_predicate_extension, [assumptions([a8])], [c21, c22])).
% 0.08/0.38  
% 0.08/0.38  cnf(c25, axiom,
% 0.08/0.38  	r1(X6,X6)).
% 0.08/0.38  cnf(a9, assumption,
% 0.08/0.38  	sK8 = X6).
% 0.08/0.38  cnf(a10, assumption,
% 0.08/0.38  	X5 = X6).
% 0.08/0.38  cnf(c26, plain,
% 0.08/0.38  	$false,
% 0.08/0.38  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c24, c25])).
% 0.08/0.38  cnf(c27, plain,
% 0.08/0.38  	$false,
% 0.08/0.38  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c24, c25])).
% 0.08/0.38  
% 0.08/0.38  cnf(c28, plain,
% 0.08/0.38  	$false,
% 0.08/0.38  	inference(constraint_solving, [
% 0.08/0.38  		bind(X0, sK8),
% 0.08/0.38  		bind(X1, sK8),
% 0.08/0.38  		bind(X2, sK7(X1)),
% 0.08/0.38  		bind(X3, sK8),
% 0.08/0.38  		bind(X4, sK8),
% 0.08/0.38  		bind(X5, sK8),
% 0.08/0.38  		bind(X6, sK8)
% 0.08/0.38  	],
% 0.08/0.38  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 0.08/0.38  
% 0.08/0.38  % SZS output end IncompleteProof
%------------------------------------------------------------------------------