↑ Up

lazyCoP---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : LCL454+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n015.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:28:45 PM UTC 2026

% Result   : Theorem 114.42s 15.01s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL454+1 : TPTP v9.3.1. Bugfixed v9.2.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.35  % Computer : n015.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sat Sep  5 21:42:58 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 114.42/15.01  % SZS status Theorem
% 114.42/15.01  % SZS output begin IncompleteProof
% 114.42/15.01  cnf(c0, axiom,
% 114.42/15.01  	~r1).
% 114.42/15.01  cnf(c1, plain,
% 114.42/15.01  	~r1,
% 114.42/15.01  	inference(start, [], [c0])).
% 114.42/15.01  
% 114.42/15.01  cnf(c2, axiom,
% 114.42/15.01  	r1 | ~is_a_theorem(implies(or(sK44,sK44),sK44))).
% 114.42/15.01  cnf(c3, plain,
% 114.42/15.01  	$false,
% 114.42/15.01  	inference(strict_predicate_extension, [], [c1, c2])).
% 114.42/15.01  cnf(c4, plain,
% 114.42/15.01  	~is_a_theorem(implies(or(sK44,sK44),sK44)),
% 114.42/15.01  	inference(strict_predicate_extension, [], [c1, c2])).
% 114.42/15.01  
% 114.42/15.01  cnf(c5, axiom,
% 114.42/15.01  	is_a_theorem(X0) | ~is_a_theorem(implies(X1,X0)) | ~is_a_theorem(X1) | ~modus_ponens).
% 114.42/15.01  cnf(a0, assumption,
% 114.42/15.01  	implies(or(sK44,sK44),sK44) = X0).
% 114.42/15.01  cnf(c6, plain,
% 114.42/15.01  	$false,
% 114.42/15.01  	inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])).
% 114.42/15.01  cnf(c7, plain,
% 114.42/15.01  	~is_a_theorem(implies(X1,X0)) | ~is_a_theorem(X1) | ~modus_ponens,
% 114.42/15.01  	inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])).
% 114.42/15.01  
% 114.42/15.01  cnf(c8, axiom,
% 114.42/15.01  	is_a_theorem(implies(implies(X2,implies(X2,X3)),implies(X2,X3))) | ~implies_2).
% 114.42/15.01  cnf(a1, assumption,
% 114.42/15.01  	implies(X1,X0) = implies(implies(X2,implies(X2,X3)),implies(X2,X3))).
% 114.42/15.01  cnf(c9, plain,
% 114.42/15.01  	~is_a_theorem(X1) | ~modus_ponens,
% 114.42/15.01  	inference(strict_predicate_extension, [assumptions([a1])], [c7, c8])).
% 114.42/15.01  cnf(c10, plain,
% 114.42/15.01  	~implies_2,
% 114.42/15.01  	inference(strict_predicate_extension, [assumptions([a1])], [c7, c8])).
% 114.42/15.01  
% 114.42/15.01  cnf(c11, axiom,
% 114.42/15.01  	implies_2).
% 114.42/15.01  cnf(c12, plain,
% 114.42/15.01  	$false,
% 114.42/15.01  	inference(strict_predicate_extension, [], [c10, c11])).
% 114.42/15.01  cnf(c13, plain,
% 114.42/15.01  	$false,
% 114.42/15.01  	inference(strict_predicate_extension, [], [c10, c11])).
% 114.42/15.01  
% 114.42/15.01  cnf(c14, axiom,
% 114.42/15.01  	is_a_theorem(X4) | ~is_a_theorem(implies(X5,X4)) | ~is_a_theorem(X5) | ~modus_ponens).
% 114.42/15.01  cnf(a2, assumption,
% 114.42/15.01  	X1 = X4).
% 114.42/15.01  cnf(c15, plain,
% 114.42/15.01  	~modus_ponens,
% 114.42/15.01  	inference(strict_predicate_extension, [assumptions([a2])], [c9, c14])).
% 114.42/15.01  cnf(c16, plain,
% 114.42/15.01  	~is_a_theorem(implies(X5,X4)) | ~is_a_theorem(X5) | ~modus_ponens,
% 114.42/15.01  	inference(strict_predicate_extension, [assumptions([a2])], [c9, c14])).
% 114.42/15.01  
% 114.42/15.01  cnf(c17, axiom,
% 114.42/15.01  	is_a_theorem(X6) | ~is_a_theorem(implies(X7,X6)) | ~is_a_theorem(X7) | ~modus_ponens).
% 114.42/15.01  cnf(a3, assumption,
% 114.42/15.01  	implies(X5,X4) = X6).
% 114.42/15.01  cnf(c18, plain,
% 114.42/15.01  	~is_a_theorem(X5) | ~modus_ponens,
% 114.42/15.01  	inference(strict_predicate_extension, [assumptions([a3])], [c16, c17])).
% 114.42/15.01  cnf(c19, plain,
% 114.42/15.01  	~is_a_theorem(implies(X7,X6)) | ~is_a_theorem(X7) | ~modus_ponens,
% 114.42/15.01  	inference(strict_predicate_extension, [assumptions([a3])], [c16, c17])).
% 114.42/15.01  
% 114.42/15.01  cnf(c20, axiom,
% 114.42/15.01  	is_a_theorem(implies(implies(X8,X9),implies(implies(X10,X9),implies(or(X8,X10),X9)))) | ~or_3).
% 114.42/15.01  cnf(a4, assumption,
% 114.42/15.01  	implies(X7,X6) = implies(implies(X8,X9),implies(implies(X10,X9),implies(or(X8,X10),X9)))).
% 114.42/15.01  cnf(c21, plain,
% 114.42/15.01  	~is_a_theorem(X7) | ~modus_ponens,
% 114.42/15.01  	inference(strict_predicate_extension, [assumptions([a4])], [c19, c20])).
% 114.42/15.01  cnf(c22, plain,
% 114.42/15.01  	~or_3,
% 114.42/15.01  	inference(strict_predicate_extension, [assumptions([a4])], [c19, c20])).
% 114.42/15.01  
% 114.42/15.01  cnf(c23, axiom,
% 114.42/15.01  	or_3).
% 114.42/15.01  cnf(c24, plain,
% 114.42/15.01  	$false,
% 114.42/15.01  	inference(strict_predicate_extension, [], [c22, c23])).
% 114.42/15.01  cnf(c25, plain,
% 114.42/15.01  	$false,
% 114.42/15.01  	inference(strict_predicate_extension, [], [c22, c23])).
% 114.42/15.01  
% 114.42/15.01  cnf(c26, axiom,
% 114.42/15.01  	is_a_theorem(implies(X11,implies(X12,X11))) | ~implies_1).
% 114.42/15.01  cnf(a5, assumption,
% 114.42/15.01  	X7 = implies(X11,implies(X12,X11))).
% 114.42/15.01  cnf(c27, plain,
% 114.42/15.01  	~modus_ponens,
% 114.42/15.01  	inference(strict_predicate_extension, [assumptions([a5])], [c21, c26])).
% 114.42/15.01  cnf(c28, plain,
% 114.42/15.01  	~implies_1,
% 114.42/15.01  	inference(strict_predicate_extension, [assumptions([a5])], [c21, c26])).
% 114.42/15.01  
% 114.42/15.01  cnf(c29, axiom,
% 114.42/15.01  	implies_1).
% 114.42/15.01  cnf(c30, plain,
% 114.42/15.01  	$false,
% 114.42/15.01  	inference(strict_predicate_extension, [], [c28, c29])).
% 114.42/15.01  cnf(c31, plain,
% 114.42/15.01  	$false,
% 114.42/15.01  	inference(strict_predicate_extension, [], [c28, c29])).
% 114.42/15.01  
% 114.42/15.01  cnf(c32, axiom,
% 114.42/15.01  	modus_ponens).
% 114.42/15.01  cnf(c33, plain,
% 114.42/15.01  	$false,
% 114.42/15.01  	inference(strict_predicate_extension, [], [c27, c32])).
% 114.42/15.01  cnf(c34, plain,
% 114.42/15.01  	$false,
% 114.42/15.01  	inference(strict_predicate_extension, [], [c27, c32])).
% 114.42/15.01  
% 114.42/15.01  cnf(c35, plain,
% 114.42/15.01  	is_a_theorem(X7)).
% 114.42/15.01  cnf(a6, assumption,
% 114.42/15.01  	X5 = X7).
% 114.42/15.01  cnf(c36, plain,
% 114.42/15.01  	~modus_ponens,
% 114.42/15.01  	inference(predicate_reduction, [assumptions([a6])], [c18, c35])).
% 114.42/15.01  
% 114.42/15.01  cnf(c37, plain,
% 114.42/15.01  	modus_ponens).
% 114.42/15.01  cnf(c38, plain,
% 114.42/15.01  	$false,
% 114.42/15.01  	inference(predicate_reduction, [], [c36, c37])).
% 114.42/15.01  
% 114.42/15.01  cnf(c39, plain,
% 114.42/15.01  	modus_ponens).
% 114.42/15.01  cnf(c40, plain,
% 114.42/15.01  	$false,
% 114.42/15.01  	inference(predicate_reduction, [], [c15, c39])).
% 114.42/15.01  
% 114.42/15.01  cnf(c41, plain,
% 114.42/15.01  	$false,
% 114.42/15.01  	inference(constraint_solving, [
% 114.42/15.01  		bind(X0, implies(or(sK44,sK44),sK44)),
% 114.42/15.01  		bind(X1, implies(X2,implies(X2,X3))),
% 114.42/15.01  		bind(X2, or(sK44,sK44)),
% 114.42/15.01  		bind(X3, sK44),
% 114.42/15.01  		bind(X4, implies(X2,implies(X2,X3))),
% 114.42/15.01  		bind(X5, implies(X10,X9)),
% 114.42/15.01  		bind(X6, implies(X5,X4)),
% 114.42/15.01  		bind(X7, implies(X8,X9)),
% 114.42/15.01  		bind(X8, sK44),
% 114.42/15.01  		bind(X9, implies(X2,X3)),
% 114.42/15.01  		bind(X10, sK44),
% 114.42/15.01  		bind(X11, sK44),
% 114.42/15.01  		bind(X12, or(sK44,sK44))
% 114.42/15.01  	],
% 114.42/15.01  	[a0, a1, a2, a3, a4, a5, a6])).
% 114.42/15.01  
% 114.42/15.01  % SZS output end IncompleteProof
%------------------------------------------------------------------------------