↑ Up

lazyCoP---0.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : LCL361-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 : n001.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.13s 0.37s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL361-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.03  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.08/0.35  % Computer : n001.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sat Sep  5 01:39:45 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.13/0.37  % SZS status Unsatisfiable
% 0.13/0.37  % SZS output begin IncompleteProof
% 0.13/0.37  cnf(c0, axiom,
% 0.13/0.37  	~is_a_theorem(implies(x,implies(implies(implies(not(x),x),x),implies(implies(y,x),x))))).
% 0.13/0.37  cnf(c1, plain,
% 0.13/0.37  	~is_a_theorem(implies(x,implies(implies(implies(not(x),x),x),implies(implies(y,x),x)))),
% 0.13/0.37  	inference(start, [], [c0])).
% 0.13/0.37  
% 0.13/0.37  cnf(c2, axiom,
% 0.13/0.37  	is_a_theorem(X0) | ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0))).
% 0.13/0.37  cnf(a0, assumption,
% 0.13/0.37  	implies(x,implies(implies(implies(not(x),x),x),implies(implies(y,x),x))) = X0).
% 0.13/0.37  cnf(c3, plain,
% 0.13/0.37  	$false,
% 0.13/0.37  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.37  cnf(c4, plain,
% 0.13/0.37  	~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0)),
% 0.13/0.37  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.13/0.37  
% 0.13/0.37  cnf(c5, axiom,
% 0.13/0.37  	is_a_theorem(implies(implies(X2,X3),implies(implies(X3,X4),implies(X2,X4))))).
% 0.13/0.37  cnf(a1, assumption,
% 0.13/0.37  	X1 = implies(implies(X2,X3),implies(implies(X3,X4),implies(X2,X4)))).
% 0.13/0.37  cnf(c6, plain,
% 0.13/0.37  	~is_a_theorem(implies(X1,X0)),
% 0.13/0.37  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.13/0.37  cnf(c7, plain,
% 0.13/0.37  	$false,
% 0.13/0.37  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.13/0.37  
% 0.13/0.37  cnf(c8, axiom,
% 0.13/0.37  	is_a_theorem(X5) | ~is_a_theorem(X6) | ~is_a_theorem(implies(X6,X5))).
% 0.13/0.37  cnf(a2, assumption,
% 0.13/0.37  	implies(X1,X0) = X5).
% 0.13/0.37  cnf(c9, plain,
% 0.13/0.37  	$false,
% 0.13/0.37  	inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])).
% 0.13/0.37  cnf(c10, plain,
% 0.13/0.37  	~is_a_theorem(X6) | ~is_a_theorem(implies(X6,X5)),
% 0.13/0.37  	inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])).
% 0.13/0.37  
% 0.13/0.37  cnf(c11, axiom,
% 0.13/0.37  	is_a_theorem(X7) | ~is_a_theorem(X8) | ~is_a_theorem(implies(X8,X7))).
% 0.13/0.37  cnf(a3, assumption,
% 0.13/0.37  	X6 = X7).
% 0.13/0.37  cnf(c12, plain,
% 0.13/0.37  	~is_a_theorem(implies(X6,X5)),
% 0.13/0.37  	inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.13/0.37  cnf(c13, plain,
% 0.13/0.37  	~is_a_theorem(X8) | ~is_a_theorem(implies(X8,X7)),
% 0.13/0.37  	inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.13/0.37  
% 0.13/0.37  cnf(c14, axiom,
% 0.13/0.37  	is_a_theorem(implies(implies(X9,X10),implies(implies(X10,X11),implies(X9,X11))))).
% 0.13/0.37  cnf(a4, assumption,
% 0.13/0.37  	X8 = implies(implies(X9,X10),implies(implies(X10,X11),implies(X9,X11)))).
% 0.13/0.37  cnf(c15, plain,
% 0.13/0.37  	~is_a_theorem(implies(X8,X7)),
% 0.13/0.37  	inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 0.13/0.37  cnf(c16, plain,
% 0.13/0.37  	$false,
% 0.13/0.37  	inference(strict_predicate_extension, [assumptions([a4])], [c13, c14])).
% 0.13/0.37  
% 0.13/0.37  cnf(c17, axiom,
% 0.13/0.37  	is_a_theorem(X12) | ~is_a_theorem(X13) | ~is_a_theorem(implies(X13,X12))).
% 0.13/0.37  cnf(a5, assumption,
% 0.13/0.37  	implies(X8,X7) = X12).
% 0.13/0.37  cnf(c18, plain,
% 0.13/0.37  	$false,
% 0.13/0.37  	inference(strict_predicate_extension, [assumptions([a5])], [c15, c17])).
% 0.13/0.37  cnf(c19, plain,
% 0.13/0.37  	~is_a_theorem(X13) | ~is_a_theorem(implies(X13,X12)),
% 0.13/0.37  	inference(strict_predicate_extension, [assumptions([a5])], [c15, c17])).
% 0.13/0.37  
% 0.13/0.37  cnf(c20, axiom,
% 0.13/0.37  	is_a_theorem(implies(X14,implies(not(X14),X15)))).
% 0.13/0.37  cnf(a6, assumption,
% 0.13/0.37  	X13 = implies(X14,implies(not(X14),X15))).
% 0.13/0.37  cnf(c21, plain,
% 0.13/0.37  	~is_a_theorem(implies(X13,X12)),
% 0.13/0.37  	inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])).
% 0.13/0.37  cnf(c22, plain,
% 0.13/0.37  	$false,
% 0.13/0.37  	inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])).
% 0.13/0.37  
% 0.13/0.37  cnf(c23, axiom,
% 0.13/0.37  	is_a_theorem(implies(implies(X16,X17),implies(implies(X17,X18),implies(X16,X18))))).
% 0.13/0.37  cnf(a7, assumption,
% 0.13/0.37  	implies(X13,X12) = implies(implies(X16,X17),implies(implies(X17,X18),implies(X16,X18)))).
% 0.13/0.37  cnf(c24, plain,
% 0.13/0.37  	$false,
% 0.13/0.37  	inference(strict_predicate_extension, [assumptions([a7])], [c21, c23])).
% 0.13/0.37  cnf(c25, plain,
% 0.13/0.37  	$false,
% 0.13/0.37  	inference(strict_predicate_extension, [assumptions([a7])], [c21, c23])).
% 0.13/0.37  
% 0.13/0.37  cnf(c26, axiom,
% 0.13/0.37  	is_a_theorem(implies(implies(X19,X20),implies(implies(X20,X21),implies(X19,X21))))).
% 0.13/0.37  cnf(a8, assumption,
% 0.13/0.37  	implies(X6,X5) = implies(implies(X19,X20),implies(implies(X20,X21),implies(X19,X21)))).
% 0.13/0.37  cnf(c27, plain,
% 0.13/0.37  	$false,
% 0.13/0.37  	inference(strict_predicate_extension, [assumptions([a8])], [c12, c26])).
% 0.13/0.37  cnf(c28, plain,
% 0.13/0.37  	$false,
% 0.13/0.37  	inference(strict_predicate_extension, [assumptions([a8])], [c12, c26])).
% 0.13/0.37  
% 0.13/0.37  cnf(c29, plain,
% 0.13/0.37  	$false,
% 0.13/0.37  	inference(constraint_solving, [
% 0.13/0.37  		bind(X0, implies(x,implies(implies(implies(not(x),x),x),implies(implies(y,x),x)))),
% 0.13/0.37  		bind(X1, implies(implies(X2,X3),implies(implies(X3,X4),implies(X2,X4)))),
% 0.13/0.37  		bind(X2, implies(X10,X11)),
% 0.13/0.37  		bind(X3, implies(X9,X11)),
% 0.13/0.37  		bind(X4, x),
% 0.13/0.37  		bind(X5, implies(X1,X0)),
% 0.13/0.37  		bind(X6, implies(X16,X18)),
% 0.13/0.37  		bind(X7, implies(X16,X18)),
% 0.13/0.37  		bind(X8, implies(implies(X9,X10),implies(implies(X10,X11),implies(X9,X11)))),
% 0.13/0.37  		bind(X9, not(X14)),
% 0.13/0.37  		bind(X10, y),
% 0.13/0.37  		bind(X11, x),
% 0.13/0.37  		bind(X12, implies(X8,X7)),
% 0.13/0.37  		bind(X13, implies(X14,implies(not(X14),X15))),
% 0.13/0.37  		bind(X14, x),
% 0.13/0.37  		bind(X15, y),
% 0.13/0.37  		bind(X16, x),
% 0.13/0.37  		bind(X17, implies(not(X14),X15)),
% 0.13/0.37  		bind(X18, implies(implies(X10,X11),implies(X9,X11))),
% 0.13/0.37  		bind(X19, x),
% 0.13/0.37  		bind(X20, implies(implies(X10,X11),implies(X9,X11))),
% 0.13/0.37  		bind(X21, implies(implies(X3,X4),implies(X2,X4)))
% 0.13/0.37  	],
% 0.13/0.37  	[a0, a1, a2, a3, a4, a5, a6, a7, a8])).
% 0.13/0.37  
% 0.13/0.37  % SZS output end IncompleteProof
%------------------------------------------------------------------------------