↑ Up

lazyCoP---0.1.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : LCL456+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 : n027.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 3.45s 0.86s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL456+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.36  % Computer : n027.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 : Fri Sep  4 18:45:12 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 3.45/0.86  % SZS status Theorem
% 3.45/0.86  % SZS output begin IncompleteProof
% 3.45/0.86  cnf(c0, axiom,
% 3.45/0.86  	~r3).
% 3.45/0.86  cnf(c1, plain,
% 3.45/0.86  	~r3,
% 3.45/0.86  	inference(start, [], [c0])).
% 3.45/0.86  
% 3.45/0.86  cnf(c2, axiom,
% 3.45/0.86  	r3 | ~is_a_theorem(implies(or(sK47,sK48),or(sK48,sK47)))).
% 3.45/0.86  cnf(c3, plain,
% 3.45/0.86  	$false,
% 3.45/0.86  	inference(strict_predicate_extension, [], [c1, c2])).
% 3.45/0.86  cnf(c4, plain,
% 3.45/0.86  	~is_a_theorem(implies(or(sK47,sK48),or(sK48,sK47))),
% 3.45/0.86  	inference(strict_predicate_extension, [], [c1, c2])).
% 3.45/0.86  
% 3.45/0.86  cnf(c5, axiom,
% 3.45/0.86  	is_a_theorem(X0) | ~is_a_theorem(implies(X1,X0)) | ~is_a_theorem(X1) | ~modus_ponens).
% 3.45/0.86  cnf(a0, assumption,
% 3.45/0.86  	implies(or(sK47,sK48),or(sK48,sK47)) = X0).
% 3.45/0.86  cnf(c6, plain,
% 3.45/0.86  	$false,
% 3.45/0.86  	inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])).
% 3.45/0.86  cnf(c7, plain,
% 3.45/0.86  	~is_a_theorem(implies(X1,X0)) | ~is_a_theorem(X1) | ~modus_ponens,
% 3.45/0.86  	inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])).
% 3.45/0.86  
% 3.45/0.86  cnf(c8, axiom,
% 3.45/0.86  	is_a_theorem(X2) | ~is_a_theorem(implies(X3,X2)) | ~is_a_theorem(X3) | ~modus_ponens).
% 3.45/0.86  cnf(a1, assumption,
% 3.45/0.86  	implies(X1,X0) = X2).
% 3.45/0.86  cnf(c9, plain,
% 3.45/0.86  	~is_a_theorem(X1) | ~modus_ponens,
% 3.45/0.86  	inference(strict_predicate_extension, [assumptions([a1])], [c7, c8])).
% 3.45/0.86  cnf(c10, plain,
% 3.45/0.86  	~is_a_theorem(implies(X3,X2)) | ~is_a_theorem(X3) | ~modus_ponens,
% 3.45/0.86  	inference(strict_predicate_extension, [assumptions([a1])], [c7, c8])).
% 3.45/0.86  
% 3.45/0.86  cnf(c11, axiom,
% 3.45/0.86  	is_a_theorem(implies(implies(X4,X5),implies(implies(X6,X5),implies(or(X4,X6),X5)))) | ~or_3).
% 3.45/0.86  cnf(a2, assumption,
% 3.45/0.86  	implies(X3,X2) = implies(implies(X4,X5),implies(implies(X6,X5),implies(or(X4,X6),X5)))).
% 3.45/0.86  cnf(c12, plain,
% 3.45/0.86  	~is_a_theorem(X3) | ~modus_ponens,
% 3.45/0.86  	inference(strict_predicate_extension, [assumptions([a2])], [c10, c11])).
% 3.45/0.86  cnf(c13, plain,
% 3.45/0.86  	~or_3,
% 3.45/0.86  	inference(strict_predicate_extension, [assumptions([a2])], [c10, c11])).
% 3.45/0.86  
% 3.45/0.86  cnf(c14, axiom,
% 3.45/0.86  	or_3).
% 3.45/0.86  cnf(c15, plain,
% 3.45/0.86  	$false,
% 3.45/0.86  	inference(strict_predicate_extension, [], [c13, c14])).
% 3.45/0.86  cnf(c16, plain,
% 3.45/0.86  	$false,
% 3.45/0.86  	inference(strict_predicate_extension, [], [c13, c14])).
% 3.45/0.86  
% 3.45/0.86  cnf(c17, axiom,
% 3.45/0.86  	is_a_theorem(implies(X7,or(X8,X7))) | ~or_2).
% 3.45/0.86  cnf(a3, assumption,
% 3.45/0.86  	X3 = implies(X7,or(X8,X7))).
% 3.45/0.86  cnf(c18, plain,
% 3.45/0.86  	~modus_ponens,
% 3.45/0.86  	inference(strict_predicate_extension, [assumptions([a3])], [c12, c17])).
% 3.45/0.86  cnf(c19, plain,
% 3.45/0.86  	~or_2,
% 3.45/0.86  	inference(strict_predicate_extension, [assumptions([a3])], [c12, c17])).
% 3.45/0.86  
% 3.45/0.86  cnf(c20, axiom,
% 3.45/0.86  	or_2).
% 3.45/0.86  cnf(c21, plain,
% 3.45/0.86  	$false,
% 3.45/0.86  	inference(strict_predicate_extension, [], [c19, c20])).
% 3.45/0.86  cnf(c22, plain,
% 3.45/0.86  	$false,
% 3.45/0.86  	inference(strict_predicate_extension, [], [c19, c20])).
% 3.45/0.86  
% 3.45/0.86  cnf(c23, axiom,
% 3.45/0.86  	modus_ponens).
% 3.45/0.86  cnf(c24, plain,
% 3.45/0.86  	$false,
% 3.45/0.86  	inference(strict_predicate_extension, [], [c18, c23])).
% 3.45/0.86  cnf(c25, plain,
% 3.45/0.86  	$false,
% 3.45/0.86  	inference(strict_predicate_extension, [], [c18, c23])).
% 3.45/0.86  
% 3.45/0.86  cnf(c26, axiom,
% 3.45/0.86  	is_a_theorem(implies(X9,or(X9,X10))) | ~or_1).
% 3.45/0.86  cnf(a4, assumption,
% 3.45/0.86  	X1 = implies(X9,or(X9,X10))).
% 3.45/0.86  cnf(c27, plain,
% 3.45/0.86  	~modus_ponens,
% 3.45/0.86  	inference(strict_predicate_extension, [assumptions([a4])], [c9, c26])).
% 3.45/0.86  cnf(c28, plain,
% 3.45/0.86  	~or_1,
% 3.45/0.86  	inference(strict_predicate_extension, [assumptions([a4])], [c9, c26])).
% 3.45/0.86  
% 3.45/0.86  cnf(c29, axiom,
% 3.45/0.86  	or_1).
% 3.45/0.86  cnf(c30, plain,
% 3.45/0.86  	$false,
% 3.45/0.86  	inference(strict_predicate_extension, [], [c28, c29])).
% 3.45/0.86  cnf(c31, plain,
% 3.45/0.86  	$false,
% 3.45/0.86  	inference(strict_predicate_extension, [], [c28, c29])).
% 3.45/0.86  
% 3.45/0.86  cnf(c32, plain,
% 3.45/0.86  	modus_ponens).
% 3.45/0.86  cnf(c33, plain,
% 3.45/0.86  	$false,
% 3.45/0.86  	inference(predicate_reduction, [], [c27, c32])).
% 3.45/0.86  
% 3.45/0.86  cnf(c34, plain,
% 3.45/0.86  	$false,
% 3.45/0.86  	inference(constraint_solving, [
% 3.45/0.86  		bind(X0, implies(or(sK47,sK48),or(sK48,sK47))),
% 3.45/0.86  		bind(X1, implies(X6,X5)),
% 3.45/0.86  		bind(X2, implies(X1,X0)),
% 3.45/0.86  		bind(X3, implies(X4,X5)),
% 3.45/0.86  		bind(X4, sK47),
% 3.45/0.86  		bind(X5, or(sK48,sK47)),
% 3.45/0.86  		bind(X6, sK48),
% 3.45/0.86  		bind(X7, sK47),
% 3.45/0.86  		bind(X8, sK48),
% 3.45/0.86  		bind(X9, sK48),
% 3.45/0.86  		bind(X10, sK47)
% 3.45/0.86  	],
% 3.45/0.86  	[a0, a1, a2, a3, a4])).
% 3.45/0.86  
% 3.45/0.86  % SZS output end IncompleteProof
%------------------------------------------------------------------------------