TSTP Solution File: LCL491+1 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : LCL491+1 : TPTP v8.1.0. Released v3.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  : 600s
% DateTime : Sun Jul 17 12:09:30 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : LCL491+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.14  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.36  % Computer : n021.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Sat Jul  2 23:17:00 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.14/0.37  % SZS status Theorem
% 0.14/0.37  % SZS output begin IncompleteProof
% 0.14/0.37  cnf(c0, axiom,
% 0.14/0.37  	~or_2).
% 0.14/0.37  cnf(c1, plain,
% 0.14/0.37  	~or_2,
% 0.14/0.37  	inference(start, [], [c0])).
% 0.14/0.37  
% 0.14/0.37  cnf(c2, axiom,
% 0.14/0.37  	or_2 | ~is_a_theorem(implies(sK22,or(sK21,sK22)))).
% 0.14/0.37  cnf(c3, plain,
% 0.14/0.37  	$false,
% 0.14/0.37  	inference(strict_predicate_extension, [], [c1, c2])).
% 0.14/0.37  cnf(c4, plain,
% 0.14/0.37  	~is_a_theorem(implies(sK22,or(sK21,sK22))),
% 0.14/0.37  	inference(strict_predicate_extension, [], [c1, c2])).
% 0.14/0.37  
% 0.14/0.37  cnf(c5, axiom,
% 0.14/0.37  	is_a_theorem(implies(X0,or(X1,X0))) | ~r2).
% 0.14/0.37  cnf(a0, assumption,
% 0.14/0.37  	implies(sK22,or(sK21,sK22)) = implies(X0,or(X1,X0))).
% 0.14/0.37  cnf(c6, plain,
% 0.14/0.37  	$false,
% 0.14/0.37  	inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])).
% 0.14/0.37  cnf(c7, plain,
% 0.14/0.37  	~r2,
% 0.14/0.37  	inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])).
% 0.14/0.37  
% 0.14/0.37  cnf(c8, axiom,
% 0.14/0.37  	r2).
% 0.14/0.37  cnf(c9, plain,
% 0.14/0.37  	$false,
% 0.14/0.37  	inference(strict_predicate_extension, [], [c7, c8])).
% 0.14/0.37  cnf(c10, plain,
% 0.14/0.37  	$false,
% 0.14/0.37  	inference(strict_predicate_extension, [], [c7, c8])).
% 0.14/0.37  
% 0.14/0.37  cnf(c11, plain,
% 0.14/0.37  	$false,
% 0.14/0.37  	inference(constraint_solving, [
% 0.14/0.37  		bind(X0, sK22),
% 0.14/0.37  		bind(X1, sK21)
% 0.14/0.37  	],
% 0.14/0.37  	[a0])).
% 0.14/0.37  
% 0.14/0.37  % SZS output end IncompleteProof
%------------------------------------------------------------------------------