↑ Up

lazyCoP---0.1.THM-Ass.s

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

% Result   : Theorem 0.10s 0.42s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL536+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.10/0.37  % Computer : n027.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sat Sep  5 02:52:13 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.42  % SZS status Theorem
% 0.10/0.42  % SZS output begin IncompleteProof
% 0.10/0.42  cnf(c0, axiom,
% 0.10/0.42  	~axiom_m10).
% 0.10/0.42  cnf(c1, plain,
% 0.10/0.42  	~axiom_m10,
% 0.10/0.42  	inference(start, [], [c0])).
% 0.10/0.42  
% 0.10/0.42  cnf(c2, axiom,
% 0.10/0.42  	axiom_m10 | ~is_a_theorem(strict_implies(possibly(sK93),necessarily(possibly(sK93))))).
% 0.10/0.42  cnf(c3, plain,
% 0.10/0.42  	$false,
% 0.10/0.42  	inference(strict_predicate_extension, [], [c1, c2])).
% 0.10/0.42  cnf(c4, plain,
% 0.10/0.42  	~is_a_theorem(strict_implies(possibly(sK93),necessarily(possibly(sK93)))),
% 0.10/0.42  	inference(strict_predicate_extension, [], [c1, c2])).
% 0.10/0.42  
% 0.10/0.42  cnf(c5, axiom,
% 0.10/0.42  	strict_implies(X0,X1) = necessarily(implies(X0,X1)) | ~op_strict_implies).
% 0.10/0.42  cnf(a0, assumption,
% 0.10/0.42  	strict_implies(possibly(sK93),necessarily(possibly(sK93))) = strict_implies(X0,X1)).
% 0.10/0.42  cnf(c6, plain,
% 0.10/0.42  	$false,
% 0.10/0.42  	inference(strict_function_extension, [assumptions([a0])], [c4, c5])).
% 0.10/0.42  cnf(c7, plain,
% 0.10/0.42  	~op_strict_implies,
% 0.10/0.42  	inference(strict_function_extension, [assumptions([a0])], [c4, c5])).
% 0.10/0.42  cnf(c8, plain,
% 0.10/0.42  	X2 != necessarily(implies(X0,X1)) | ~is_a_theorem(X2),
% 0.10/0.42  	inference(strict_function_extension, [assumptions([a0])], [c4, c5])).
% 0.10/0.42  
% 0.10/0.42  cnf(a1, assumption,
% 0.10/0.42  	X2 = necessarily(implies(X0,X1))).
% 0.10/0.42  cnf(c9, plain,
% 0.10/0.42  	~is_a_theorem(X2),
% 0.10/0.42  	inference(reflexivity, [assumptions([a1])], [c8])).
% 0.10/0.42  
% 0.10/0.42  cnf(c10, axiom,
% 0.10/0.42  	is_a_theorem(necessarily(X3)) | ~is_a_theorem(X3) | ~necessitation).
% 0.10/0.42  cnf(a2, assumption,
% 0.10/0.42  	X2 = necessarily(X3)).
% 0.10/0.42  cnf(c11, plain,
% 0.10/0.42  	$false,
% 0.10/0.42  	inference(strict_predicate_extension, [assumptions([a2])], [c9, c10])).
% 0.10/0.42  cnf(c12, plain,
% 0.10/0.42  	~is_a_theorem(X3) | ~necessitation,
% 0.10/0.42  	inference(strict_predicate_extension, [assumptions([a2])], [c9, c10])).
% 0.10/0.42  
% 0.10/0.42  cnf(c13, axiom,
% 0.10/0.42  	is_a_theorem(implies(possibly(X4),necessarily(possibly(X4)))) | ~axiom_5).
% 0.10/0.42  cnf(a3, assumption,
% 0.10/0.42  	X3 = implies(possibly(X4),necessarily(possibly(X4)))).
% 0.10/0.42  cnf(c14, plain,
% 0.10/0.42  	~necessitation,
% 0.10/0.42  	inference(strict_predicate_extension, [assumptions([a3])], [c12, c13])).
% 0.10/0.42  cnf(c15, plain,
% 0.10/0.42  	~axiom_5,
% 0.10/0.42  	inference(strict_predicate_extension, [assumptions([a3])], [c12, c13])).
% 0.10/0.42  
% 0.10/0.42  cnf(c16, axiom,
% 0.10/0.42  	axiom_5).
% 0.10/0.42  cnf(c17, plain,
% 0.10/0.42  	$false,
% 0.10/0.42  	inference(strict_predicate_extension, [], [c15, c16])).
% 0.10/0.42  cnf(c18, plain,
% 0.10/0.42  	$false,
% 0.10/0.42  	inference(strict_predicate_extension, [], [c15, c16])).
% 0.10/0.42  
% 0.10/0.42  cnf(c19, axiom,
% 0.10/0.42  	necessitation).
% 0.10/0.42  cnf(c20, plain,
% 0.10/0.42  	$false,
% 0.10/0.42  	inference(strict_predicate_extension, [], [c14, c19])).
% 0.10/0.42  cnf(c21, plain,
% 0.10/0.42  	$false,
% 0.10/0.42  	inference(strict_predicate_extension, [], [c14, c19])).
% 0.10/0.42  
% 0.10/0.42  cnf(c22, axiom,
% 0.10/0.42  	op_strict_implies).
% 0.10/0.42  cnf(c23, plain,
% 0.10/0.42  	$false,
% 0.10/0.42  	inference(strict_predicate_extension, [], [c7, c22])).
% 0.10/0.42  cnf(c24, plain,
% 0.10/0.42  	$false,
% 0.10/0.42  	inference(strict_predicate_extension, [], [c7, c22])).
% 0.10/0.42  
% 0.10/0.42  cnf(c25, plain,
% 0.10/0.42  	$false,
% 0.10/0.42  	inference(constraint_solving, [
% 0.10/0.42  		bind(X0, possibly(sK93)),
% 0.10/0.42  		bind(X1, necessarily(possibly(sK93))),
% 0.10/0.42  		bind(X2, necessarily(implies(X0,X1))),
% 0.10/0.42  		bind(X3, implies(X0,X1)),
% 0.10/0.42  		bind(X4, sK93)
% 0.10/0.42  	],
% 0.10/0.42  	[a0, a1, a2, a3])).
% 0.10/0.42  
% 0.10/0.42  % SZS output end IncompleteProof
%------------------------------------------------------------------------------