↑ Up

lazyCoP---0.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : LCL045-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n011.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:04 PM UTC 2026

% Result   : Unsatisfiable 4.23s 0.99s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL045-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.09/0.36  % Computer : n011.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.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Sat Sep  5 03:39:43 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 4.23/0.99  % SZS status Unsatisfiable
% 4.23/0.99  % SZS output begin IncompleteProof
% 4.23/0.99  cnf(c0, axiom,
% 4.23/0.99  	~is_a_theorem(implies(implies(a,b),implies(not(b),not(a))))).
% 4.23/0.99  cnf(c1, plain,
% 4.23/0.99  	~is_a_theorem(implies(implies(a,b),implies(not(b),not(a)))),
% 4.23/0.99  	inference(start, [], [c0])).
% 4.23/0.99  
% 4.23/0.99  cnf(c2, axiom,
% 4.23/0.99  	is_a_theorem(X0) | ~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0))).
% 4.23/0.99  cnf(a0, assumption,
% 4.23/0.99  	implies(implies(a,b),implies(not(b),not(a))) = X0).
% 4.23/0.99  cnf(c3, plain,
% 4.23/0.99  	$false,
% 4.23/0.99  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 4.23/0.99  cnf(c4, plain,
% 4.23/0.99  	~is_a_theorem(X1) | ~is_a_theorem(implies(X1,X0)),
% 4.23/0.99  	inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 4.23/0.99  
% 4.23/0.99  cnf(c5, axiom,
% 4.23/0.99  	is_a_theorem(X2) | ~is_a_theorem(X3) | ~is_a_theorem(implies(X3,X2))).
% 4.23/0.99  cnf(a1, assumption,
% 4.23/0.99  	X1 = X2).
% 4.23/0.99  cnf(c6, plain,
% 4.23/0.99  	~is_a_theorem(implies(X1,X0)),
% 4.23/0.99  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 4.23/0.99  cnf(c7, plain,
% 4.23/0.99  	~is_a_theorem(X3) | ~is_a_theorem(implies(X3,X2)),
% 4.23/0.99  	inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 4.23/0.99  
% 4.23/0.99  cnf(c8, axiom,
% 4.23/0.99  	is_a_theorem(implies(X4,implies(not(X4),X5)))).
% 4.23/0.99  cnf(a2, assumption,
% 4.23/0.99  	X3 = implies(X4,implies(not(X4),X5))).
% 4.23/0.99  cnf(c9, plain,
% 4.23/0.99  	~is_a_theorem(implies(X3,X2)),
% 4.23/0.99  	inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 4.23/0.99  cnf(c10, plain,
% 4.23/0.99  	$false,
% 4.23/0.99  	inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 4.23/0.99  
% 4.23/0.99  cnf(c11, axiom,
% 4.23/0.99  	is_a_theorem(implies(implies(X6,X7),implies(implies(X8,X6),implies(X8,X7))))).
% 4.23/0.99  cnf(a3, assumption,
% 4.23/0.99  	implies(X3,X2) = implies(implies(X6,X7),implies(implies(X8,X6),implies(X8,X7)))).
% 4.23/0.99  cnf(c12, plain,
% 4.23/0.99  	$false,
% 4.23/0.99  	inference(strict_predicate_extension, [assumptions([a3])], [c9, c11])).
% 4.23/0.99  cnf(c13, plain,
% 4.23/0.99  	$false,
% 4.23/0.99  	inference(strict_predicate_extension, [assumptions([a3])], [c9, c11])).
% 4.23/0.99  
% 4.23/0.99  cnf(c14, axiom,
% 4.23/0.99  	is_a_theorem(X9) | ~is_a_theorem(X10) | ~is_a_theorem(implies(X10,X9))).
% 4.23/0.99  cnf(a4, assumption,
% 4.23/0.99  	implies(X1,X0) = X9).
% 4.23/0.99  cnf(c15, plain,
% 4.23/0.99  	$false,
% 4.23/0.99  	inference(strict_predicate_extension, [assumptions([a4])], [c6, c14])).
% 4.23/0.99  cnf(c16, plain,
% 4.23/0.99  	~is_a_theorem(X10) | ~is_a_theorem(implies(X10,X9)),
% 4.23/0.99  	inference(strict_predicate_extension, [assumptions([a4])], [c6, c14])).
% 4.23/0.99  
% 4.23/0.99  cnf(c17, axiom,
% 4.23/0.99  	is_a_theorem(X11) | ~is_a_theorem(X12) | ~is_a_theorem(implies(X12,X11))).
% 4.23/0.99  cnf(a5, assumption,
% 4.23/0.99  	X10 = X11).
% 4.23/0.99  cnf(c18, plain,
% 4.23/0.99  	~is_a_theorem(implies(X10,X9)),
% 4.23/0.99  	inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 4.23/0.99  cnf(c19, plain,
% 4.23/0.99  	~is_a_theorem(X12) | ~is_a_theorem(implies(X12,X11)),
% 4.23/0.99  	inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])).
% 4.23/0.99  
% 4.23/0.99  cnf(c20, axiom,
% 4.23/0.99  	is_a_theorem(implies(X13,implies(X14,X13)))).
% 4.23/0.99  cnf(a6, assumption,
% 4.23/0.99  	X12 = implies(X13,implies(X14,X13))).
% 4.23/0.99  cnf(c21, plain,
% 4.23/0.99  	~is_a_theorem(implies(X12,X11)),
% 4.23/0.99  	inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])).
% 4.23/0.99  cnf(c22, plain,
% 4.23/0.99  	$false,
% 4.23/0.99  	inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])).
% 4.23/0.99  
% 4.23/0.99  cnf(c23, axiom,
% 4.23/0.99  	is_a_theorem(X15) | ~is_a_theorem(X16) | ~is_a_theorem(implies(X16,X15))).
% 4.23/0.99  cnf(a7, assumption,
% 4.23/0.99  	implies(X12,X11) = X15).
% 4.23/0.99  cnf(c24, plain,
% 4.23/0.99  	$false,
% 4.23/0.99  	inference(strict_predicate_extension, [assumptions([a7])], [c21, c23])).
% 4.23/0.99  cnf(c25, plain,
% 4.23/0.99  	~is_a_theorem(X16) | ~is_a_theorem(implies(X16,X15)),
% 4.23/0.99  	inference(strict_predicate_extension, [assumptions([a7])], [c21, c23])).
% 4.23/0.99  
% 4.23/0.99  cnf(c26, axiom,
% 4.23/0.99  	is_a_theorem(implies(implies(X17,X18),implies(implies(not(X17),X18),X18)))).
% 4.23/0.99  cnf(a8, assumption,
% 4.23/0.99  	X16 = implies(implies(X17,X18),implies(implies(not(X17),X18),X18))).
% 4.23/0.99  cnf(c27, plain,
% 4.23/0.99  	~is_a_theorem(implies(X16,X15)),
% 4.23/0.99  	inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])).
% 4.23/0.99  cnf(c28, plain,
% 4.23/0.99  	$false,
% 4.23/0.99  	inference(strict_predicate_extension, [assumptions([a8])], [c25, c26])).
% 4.23/0.99  
% 4.23/0.99  cnf(c29, axiom,
% 4.23/0.99  	is_a_theorem(implies(implies(X19,implies(X20,X21)),implies(X20,implies(X19,X21))))).
% 4.23/0.99  cnf(a9, assumption,
% 4.23/0.99  	implies(X16,X15) = implies(implies(X19,implies(X20,X21)),implies(X20,implies(X19,X21)))).
% 4.23/0.99  cnf(c30, plain,
% 4.23/0.99  	$false,
% 4.23/0.99  	inference(strict_predicate_extension, [assumptions([a9])], [c27, c29])).
% 4.23/0.99  cnf(c31, plain,
% 4.23/0.99  	$false,
% 4.23/0.99  	inference(strict_predicate_extension, [assumptions([a9])], [c27, c29])).
% 4.23/0.99  
% 4.23/0.99  cnf(c32, axiom,
% 4.23/0.99  	is_a_theorem(implies(implies(X22,X23),implies(implies(X24,X22),implies(X24,X23))))).
% 4.23/0.99  cnf(a10, assumption,
% 4.23/0.99  	implies(X10,X9) = implies(implies(X22,X23),implies(implies(X24,X22),implies(X24,X23)))).
% 4.23/0.99  cnf(c33, plain,
% 4.23/0.99  	$false,
% 4.23/0.99  	inference(strict_predicate_extension, [assumptions([a10])], [c18, c32])).
% 4.23/0.99  cnf(c34, plain,
% 4.23/0.99  	$false,
% 4.23/0.99  	inference(strict_predicate_extension, [assumptions([a10])], [c18, c32])).
% 4.23/0.99  
% 4.23/0.99  cnf(c35, plain,
% 4.23/0.99  	$false,
% 4.23/0.99  	inference(constraint_solving, [
% 4.23/0.99  		bind(X0, implies(implies(a,b),implies(not(b),not(a)))),
% 4.23/0.99  		bind(X1, implies(implies(X8,X6),implies(X8,X7))),
% 4.23/0.99  		bind(X2, implies(implies(X8,X6),implies(X8,X7))),
% 4.23/0.99  		bind(X3, implies(X4,implies(not(X4),X5))),
% 4.23/0.99  		bind(X4, b),
% 4.23/0.99  		bind(X5, not(X17)),
% 4.23/0.99  		bind(X6, b),
% 4.23/0.99  		bind(X7, implies(not(X4),X5)),
% 4.23/0.99  		bind(X8, a),
% 4.23/0.99  		bind(X9, implies(X1,X0)),
% 4.23/0.99  		bind(X10, implies(X19,X21)),
% 4.23/0.99  		bind(X11, implies(X19,X21)),
% 4.23/0.99  		bind(X12, implies(X13,implies(X14,X13))),
% 4.23/0.99  		bind(X13, not(X17)),
% 4.23/0.99  		bind(X14, not(X4)),
% 4.23/0.99  		bind(X15, implies(X12,X11)),
% 4.23/0.99  		bind(X16, implies(implies(X17,X18),implies(implies(not(X17),X18),X18))),
% 4.23/0.99  		bind(X17, a),
% 4.23/0.99  		bind(X18, implies(X14,X13)),
% 4.23/0.99  		bind(X19, implies(X17,X18)),
% 4.23/0.99  		bind(X20, implies(not(X17),X18)),
% 4.23/0.99  		bind(X21, implies(X14,X13)),
% 4.23/0.99  		bind(X22, implies(X17,X18)),
% 4.23/0.99  		bind(X23, implies(X14,X13)),
% 4.23/0.99  		bind(X24, implies(X8,X6))
% 4.23/0.99  	],
% 4.23/0.99  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 4.23/0.99  
% 4.23/0.99  % SZS output end IncompleteProof
%------------------------------------------------------------------------------