↑ Up

lazyCoP---0.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : LCL218-3 : 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 : n002.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:21 PM UTC 2026

% Result   : Unsatisfiable 2.65s 0.76s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL218-3 : 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.09/0.36  % Computer : n002.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 : Sat Sep  5 03:51:50 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 2.65/0.76  % SZS status Unsatisfiable
% 2.65/0.76  % SZS output begin IncompleteProof
% 2.65/0.76  cnf(c0, axiom,
% 2.65/0.76  	~theorem(or(not(or(not(or(p,q)),q)),or(not(p),q)))).
% 2.65/0.76  cnf(c1, plain,
% 2.65/0.76  	~theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))),
% 2.65/0.76  	inference(start, [], [c0])).
% 2.65/0.76  
% 2.65/0.76  cnf(c2, axiom,
% 2.65/0.76  	~theorem(X0) | ~theorem(or(not(X0),X1)) | theorem(X1)).
% 2.65/0.76  cnf(a0, assumption,
% 2.65/0.76  	or(not(or(not(or(p,q)),q)),or(not(p),q)) = X1).
% 2.65/0.76  cnf(c3, plain,
% 2.65/0.76  	$false,
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 2.65/0.76  cnf(c4, plain,
% 2.65/0.76  	~theorem(X0) | ~theorem(or(not(X0),X1)),
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 2.65/0.76  
% 2.65/0.76  cnf(c5, axiom,
% 2.65/0.76  	~theorem(X2) | ~theorem(or(not(X2),X3)) | theorem(X3)).
% 2.65/0.76  cnf(a1, assumption,
% 2.65/0.76  	X0 = X3).
% 2.65/0.76  cnf(c6, plain,
% 2.65/0.76  	~theorem(or(not(X0),X1)),
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 2.65/0.76  cnf(c7, plain,
% 2.65/0.76  	~theorem(X2) | ~theorem(or(not(X2),X3)),
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 2.65/0.76  
% 2.65/0.76  cnf(c8, axiom,
% 2.65/0.76  	~axiom(X4) | theorem(X4)).
% 2.65/0.76  cnf(a2, assumption,
% 2.65/0.76  	X2 = X4).
% 2.65/0.76  cnf(c9, plain,
% 2.65/0.76  	~theorem(or(not(X2),X3)),
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 2.65/0.76  cnf(c10, plain,
% 2.65/0.76  	~axiom(X4),
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 2.65/0.76  
% 2.65/0.76  cnf(c11, axiom,
% 2.65/0.76  	axiom(or(not(X5),or(X6,X5)))).
% 2.65/0.76  cnf(a3, assumption,
% 2.65/0.76  	X4 = or(not(X5),or(X6,X5))).
% 2.65/0.76  cnf(c12, plain,
% 2.65/0.76  	$false,
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 2.65/0.76  cnf(c13, plain,
% 2.65/0.76  	$false,
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 2.65/0.76  
% 2.65/0.76  cnf(c14, axiom,
% 2.65/0.76  	~theorem(X7) | ~theorem(or(not(X7),X8)) | theorem(X8)).
% 2.65/0.76  cnf(a4, assumption,
% 2.65/0.76  	or(not(X2),X3) = X8).
% 2.65/0.76  cnf(c15, plain,
% 2.65/0.76  	$false,
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a4])], [c9, c14])).
% 2.65/0.76  cnf(c16, plain,
% 2.65/0.76  	~theorem(X7) | ~theorem(or(not(X7),X8)),
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a4])], [c9, c14])).
% 2.65/0.76  
% 2.65/0.76  cnf(c17, axiom,
% 2.65/0.76  	~axiom(X9) | theorem(X9)).
% 2.65/0.76  cnf(a5, assumption,
% 2.65/0.76  	X7 = X9).
% 2.65/0.76  cnf(c18, plain,
% 2.65/0.76  	~theorem(or(not(X7),X8)),
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 2.65/0.76  cnf(c19, plain,
% 2.65/0.76  	~axiom(X9),
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 2.65/0.76  
% 2.65/0.76  cnf(c20, axiom,
% 2.65/0.76  	axiom(or(not(or(X10,X11)),or(X11,X10)))).
% 2.65/0.76  cnf(a6, assumption,
% 2.65/0.76  	X9 = or(not(or(X10,X11)),or(X11,X10))).
% 2.65/0.76  cnf(c21, plain,
% 2.65/0.76  	$false,
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])).
% 2.65/0.76  cnf(c22, plain,
% 2.65/0.76  	$false,
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])).
% 2.65/0.76  
% 2.65/0.76  cnf(c23, axiom,
% 2.65/0.76  	~axiom(X12) | theorem(X12)).
% 2.65/0.76  cnf(a7, assumption,
% 2.65/0.76  	or(not(X7),X8) = X12).
% 2.65/0.76  cnf(c24, plain,
% 2.65/0.76  	$false,
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a7])], [c18, c23])).
% 2.65/0.76  cnf(c25, plain,
% 2.65/0.76  	~axiom(X12),
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a7])], [c18, c23])).
% 2.65/0.76  
% 2.65/0.76  cnf(c26, axiom,
% 2.65/0.76  	axiom(or(not(or(not(X13),X14)),or(not(or(X15,X13)),or(X15,X14))))).
% 2.65/0.76  cnf(a8, assumption,
% 2.65/0.76  	X12 = or(not(or(not(X13),X14)),or(not(or(X15,X13)),or(X15,X14)))).
% 2.65/0.76  cnf(c27, plain,
% 2.65/0.76  	$false,
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])).
% 2.65/0.76  cnf(c28, plain,
% 2.65/0.76  	$false,
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])).
% 2.65/0.76  
% 2.65/0.76  cnf(c29, axiom,
% 2.65/0.76  	~theorem(X16) | ~theorem(or(not(X16),X17)) | theorem(X17)).
% 2.65/0.76  cnf(a9, assumption,
% 2.65/0.76  	or(not(X0),X1) = X17).
% 2.65/0.76  cnf(c30, plain,
% 2.65/0.76  	$false,
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a9])], [c6, c29])).
% 2.65/0.76  cnf(c31, plain,
% 2.65/0.76  	~theorem(X16) | ~theorem(or(not(X16),X17)),
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a9])], [c6, c29])).
% 2.65/0.76  
% 2.65/0.76  cnf(c32, axiom,
% 2.65/0.76  	~axiom(X18) | theorem(X18)).
% 2.65/0.76  cnf(a10, assumption,
% 2.65/0.76  	X16 = X18).
% 2.65/0.76  cnf(c33, plain,
% 2.65/0.76  	~theorem(or(not(X16),X17)),
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a10])], [c31, c32])).
% 2.65/0.76  cnf(c34, plain,
% 2.65/0.76  	~axiom(X18),
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a10])], [c31, c32])).
% 2.65/0.76  
% 2.65/0.76  cnf(c35, axiom,
% 2.65/0.76  	axiom(or(not(or(not(X19),X20)),or(not(or(X21,X19)),or(X21,X20))))).
% 2.65/0.76  cnf(a11, assumption,
% 2.65/0.76  	X18 = or(not(or(not(X19),X20)),or(not(or(X21,X19)),or(X21,X20)))).
% 2.65/0.76  cnf(c36, plain,
% 2.65/0.76  	$false,
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a11])], [c34, c35])).
% 2.65/0.76  cnf(c37, plain,
% 2.65/0.76  	$false,
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a11])], [c34, c35])).
% 2.65/0.76  
% 2.65/0.76  cnf(c38, axiom,
% 2.65/0.76  	~axiom(X22) | theorem(X22)).
% 2.65/0.76  cnf(a12, assumption,
% 2.65/0.76  	or(not(X16),X17) = X22).
% 2.65/0.76  cnf(c39, plain,
% 2.65/0.76  	$false,
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a12])], [c33, c38])).
% 2.65/0.76  cnf(c40, plain,
% 2.65/0.76  	~axiom(X22),
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a12])], [c33, c38])).
% 2.65/0.76  
% 2.65/0.76  cnf(c41, axiom,
% 2.65/0.76  	axiom(or(not(or(X23,or(X24,X25))),or(X24,or(X23,X25))))).
% 2.65/0.76  cnf(a13, assumption,
% 2.65/0.76  	X22 = or(not(or(X23,or(X24,X25))),or(X24,or(X23,X25)))).
% 2.65/0.76  cnf(c42, plain,
% 2.65/0.76  	$false,
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a13])], [c40, c41])).
% 2.65/0.76  cnf(c43, plain,
% 2.65/0.76  	$false,
% 2.65/0.76  	inference(strict_predicate_extension, [assumptions([a13])], [c40, c41])).
% 2.65/0.76  
% 2.65/0.76  cnf(c44, plain,
% 2.65/0.76  	$false,
% 2.65/0.76  	inference(constraint_solving, [
% 2.65/0.76  		bind(X0, or(X15,X14)),
% 2.65/0.76  		bind(X1, or(not(or(not(or(p,q)),q)),or(not(p),q))),
% 2.65/0.76  		bind(X2, or(not(X5),or(X6,X5))),
% 2.65/0.76  		bind(X3, or(X15,X14)),
% 2.65/0.76  		bind(X4, or(not(X5),or(X6,X5))),
% 2.65/0.76  		bind(X5, p),
% 2.65/0.76  		bind(X6, q),
% 2.65/0.76  		bind(X7, or(not(or(X10,X11)),or(X11,X10))),
% 2.65/0.76  		bind(X8, or(not(X2),X3)),
% 2.65/0.76  		bind(X9, or(not(or(X10,X11)),or(X11,X10))),
% 2.65/0.76  		bind(X10, q),
% 2.65/0.76  		bind(X11, p),
% 2.65/0.76  		bind(X12, or(not(X7),X8)),
% 2.65/0.76  		bind(X13, or(X10,X11)),
% 2.65/0.76  		bind(X14, or(X11,X10)),
% 2.65/0.76  		bind(X15, not(X5)),
% 2.65/0.76  		bind(X16, or(not(or(not(X19),X20)),or(not(or(X21,X19)),or(X21,X20)))),
% 2.65/0.76  		bind(X17, or(not(X0),X1)),
% 2.65/0.76  		bind(X18, or(not(or(not(X19),X20)),or(not(or(X21,X19)),or(X21,X20)))),
% 2.65/0.76  		bind(X19, or(X11,X10)),
% 2.65/0.76  		bind(X20, q),
% 2.65/0.76  		bind(X21, not(X5)),
% 2.65/0.76  		bind(X22, or(not(X16),X17)),
% 2.65/0.76  		bind(X23, not(or(not(X19),X20))),
% 2.65/0.76  		bind(X24, not(or(X21,X19))),
% 2.65/0.76  		bind(X25, or(X21,X20))
% 2.65/0.76  	],
% 2.65/0.76  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])).
% 2.65/0.76  
% 2.65/0.76  % SZS output end IncompleteProof
%------------------------------------------------------------------------------