↑ Up

lazyCoP---0.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : LCL357-1 : TPTP v9.3.1. Released v2.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 : n016.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:33 PM UTC 2026

% Result   : Unsatisfiable 0.18s 0.46s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : LCL357-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.18/0.44  % Computer : n016.cluster.edu
% 0.18/0.44  % Model    : x86_64 x86_64
% 0.18/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44  % Memory   : 8046.5625MB
% 0.18/0.44  % OS       : Linux 6.8.0-71-generic
% 0.18/0.44  % CPULimit : 300
% 0.18/0.44  % WCLimit  : 300
% 0.18/0.44  % DateTime : Sun Sep  6 00:44:15 UTC 2026
% 0.18/0.45  % CPUTime  : 
% 0.18/0.46  % SZS status Unsatisfiable
% 0.18/0.46  % SZS output begin IncompleteProof
% 0.18/0.46  cnf(c0, axiom,
% 0.18/0.46  	~is_a_theorem(implies(implies(x,y),implies(implies(implies(x,z),u),implies(implies(y,z),u))))).
% 0.18/0.46  cnf(c1, plain,
% 0.18/0.46  	~is_a_theorem(implies(implies(x,y),implies(implies(implies(x,z),u),implies(implies(y,z),u)))),
% 0.18/0.46  	inference(start, [], [c0])).
% 0.18/0.46  
% 0.18/0.46  cnf(c2, axiom,
% 0.18/0.46  	is_a_theorem(X0) | ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0))).
% 0.18/0.46  cnf(a0, assumption,
% 0.18/0.46  	implies(implies(x,y),implies(implies(implies(x,z),u),implies(implies(y,z),u))) = X0).
% 0.18/0.46  cnf(c3, plain,
% 0.18/0.46  	$false,
% 0.18/0.46  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.18/0.46  cnf(c4, plain,
% 0.18/0.46  	~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0)),
% 0.18/0.46  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.18/0.46  
% 0.18/0.46  cnf(c5, axiom,
% 0.18/0.46  	is_a_theorem(implies(implies(X2,X3),implies(implies(X3,X4),implies(X2,X4))))).
% 0.18/0.46  cnf(a1, assumption,
% 0.18/0.46  	X1 = implies(implies(X2,X3),implies(implies(X3,X4),implies(X2,X4)))).
% 0.18/0.46  cnf(c6, plain,
% 0.18/0.46  	~is_a_theorem(implies(X1,X0)),
% 0.18/0.46  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.18/0.46  cnf(c7, plain,
% 0.18/0.46  	$false,
% 0.18/0.46  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.18/0.46  
% 0.18/0.46  cnf(c8, axiom,
% 0.18/0.46  	is_a_theorem(X5) | ~is_a_theorem(X6) | ~is_a_theorem(implies(X6,X5))).
% 0.18/0.46  cnf(a2, assumption,
% 0.18/0.46  	implies(X1,X0) = X5).
% 0.18/0.46  cnf(c9, plain,
% 0.18/0.46  	$false,
% 0.18/0.46  	inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])).
% 0.18/0.46  cnf(c10, plain,
% 0.18/0.46  	~is_a_theorem(X6) | ~is_a_theorem(implies(X6,X5)),
% 0.18/0.46  	inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])).
% 0.18/0.46  
% 0.18/0.46  cnf(c11, axiom,
% 0.18/0.46  	is_a_theorem(implies(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9))))).
% 0.18/0.46  cnf(a3, assumption,
% 0.18/0.46  	X6 = implies(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9)))).
% 0.18/0.46  cnf(c12, plain,
% 0.18/0.46  	~is_a_theorem(implies(X6,X5)),
% 0.18/0.46  	inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.18/0.46  cnf(c13, plain,
% 0.18/0.46  	$false,
% 0.18/0.46  	inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.18/0.46  
% 0.18/0.46  cnf(c14, axiom,
% 0.18/0.46  	is_a_theorem(implies(implies(X10,X11),implies(implies(X11,X12),implies(X10,X12))))).
% 0.18/0.46  cnf(a4, assumption,
% 0.18/0.46  	implies(X6,X5) = implies(implies(X10,X11),implies(implies(X11,X12),implies(X10,X12)))).
% 0.18/0.46  cnf(c15, plain,
% 0.18/0.46  	$false,
% 0.18/0.46  	inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])).
% 0.18/0.46  cnf(c16, plain,
% 0.18/0.46  	$false,
% 0.18/0.46  	inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])).
% 0.18/0.46  
% 0.18/0.46  cnf(c17, plain,
% 0.18/0.46  	$false,
% 0.18/0.46  	inference(constraint_solving, [
% 0.18/0.46  		bind(X0, implies(implies(x,y),implies(implies(implies(x,z),u),implies(implies(y,z),u)))),
% 0.18/0.46  		bind(X1, implies(implies(X2,X3),implies(implies(X3,X4),implies(X2,X4)))),
% 0.18/0.46  		bind(X2, implies(X8,X9)),
% 0.18/0.46  		bind(X3, implies(X7,X9)),
% 0.18/0.46  		bind(X4, u),
% 0.18/0.46  		bind(X5, implies(X1,X0)),
% 0.18/0.46  		bind(X6, implies(implies(X7,X8),implies(implies(X8,X9),implies(X7,X9)))),
% 0.18/0.46  		bind(X7, x),
% 0.18/0.46  		bind(X8, y),
% 0.18/0.46  		bind(X9, z),
% 0.18/0.46  		bind(X10, implies(X7,X8)),
% 0.18/0.46  		bind(X11, implies(implies(X8,X9),implies(X7,X9))),
% 0.18/0.46  		bind(X12, implies(implies(X3,X4),implies(X2,X4)))
% 0.18/0.46  	],
% 0.18/0.46  	[a0, a1, a2, a3, a4])).
% 0.18/0.46  
% 0.18/0.46  % SZS output end IncompleteProof
%------------------------------------------------------------------------------