↑ Up

lazyCoP---0.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : NUM022-1 : TPTP v8.1.0. 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 : n012.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Mon Jul 18 11:30:31 EDT 2022

% Result   : Unsatisfiable 0.11s 0.33s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : NUM022-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.11  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.11/0.32  % Computer : n012.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Wed Jul  6 00:08:30 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.11/0.33  % SZS status Unsatisfiable
% 0.11/0.33  % SZS output begin IncompleteProof
% 0.11/0.33  cnf(c0, axiom,
% 0.11/0.33  	~less(a,d)).
% 0.11/0.33  cnf(c1, plain,
% 0.11/0.33  	~less(a,d),
% 0.11/0.33  	inference(start, [], [c0])).
% 0.11/0.33  
% 0.11/0.33  cnf(c2, axiom,
% 0.11/0.33  	less(X0,X1) | ~equalish(add(successor(X2),X0),X1)).
% 0.11/0.33  cnf(a0, assumption,
% 0.11/0.33  	a = X0).
% 0.11/0.33  cnf(a1, assumption,
% 0.11/0.33  	d = X1).
% 0.11/0.33  cnf(c3, plain,
% 0.11/0.33  	$false,
% 0.11/0.33  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.11/0.33  cnf(c4, plain,
% 0.11/0.33  	~equalish(add(successor(X2),X0),X1),
% 0.11/0.33  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.11/0.33  
% 0.11/0.33  cnf(c5, axiom,
% 0.11/0.33  	equalish(X3,X4) | ~equalish(X3,X5) | ~equalish(X5,X4)).
% 0.11/0.33  cnf(a2, assumption,
% 0.11/0.33  	add(successor(X2),X0) = X3).
% 0.11/0.33  cnf(a3, assumption,
% 0.11/0.33  	X1 = X4).
% 0.11/0.33  cnf(c6, plain,
% 0.11/0.33  	$false,
% 0.11/0.33  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.11/0.33  cnf(c7, plain,
% 0.11/0.33  	~equalish(X3,X5) | ~equalish(X5,X4),
% 0.11/0.33  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.11/0.33  
% 0.11/0.33  cnf(c8, axiom,
% 0.11/0.33  	equalish(add(successor(predecessor_of_1st_minus_2nd(X6,X7)),X7),X6) | ~less(X7,X6)).
% 0.11/0.33  cnf(a4, assumption,
% 0.11/0.33  	X3 = add(successor(predecessor_of_1st_minus_2nd(X6,X7)),X7)).
% 0.11/0.33  cnf(a5, assumption,
% 0.11/0.33  	X5 = X6).
% 0.11/0.33  cnf(c9, plain,
% 0.11/0.33  	~equalish(X5,X4),
% 0.11/0.33  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.11/0.33  cnf(c10, plain,
% 0.11/0.33  	~less(X7,X6),
% 0.11/0.33  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.11/0.33  
% 0.11/0.33  cnf(c11, axiom,
% 0.11/0.33  	less(a,b)).
% 0.11/0.33  cnf(a6, assumption,
% 0.11/0.33  	X7 = a).
% 0.11/0.33  cnf(a7, assumption,
% 0.11/0.33  	X6 = b).
% 0.11/0.33  cnf(c12, plain,
% 0.11/0.33  	$false,
% 0.11/0.33  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.11/0.33  cnf(c13, plain,
% 0.11/0.33  	$false,
% 0.11/0.33  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.11/0.33  
% 0.11/0.33  cnf(c14, axiom,
% 0.11/0.33  	equalish(X8,X9) | less(X8,X9) | ~divides(X8,X9)).
% 0.11/0.33  cnf(a8, assumption,
% 0.11/0.33  	X5 = X8).
% 0.11/0.33  cnf(a9, assumption,
% 0.11/0.33  	X4 = X9).
% 0.11/0.33  cnf(c15, plain,
% 0.11/0.33  	$false,
% 0.11/0.33  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])).
% 0.11/0.33  cnf(c16, plain,
% 0.11/0.33  	less(X8,X9) | ~divides(X8,X9),
% 0.11/0.33  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])).
% 0.11/0.33  
% 0.11/0.33  cnf(c17, axiom,
% 0.11/0.33  	less(X10,X11) | ~less(X10,X12) | ~less(X12,X11)).
% 0.11/0.33  cnf(a10, assumption,
% 0.11/0.33  	X8 = X12).
% 0.11/0.33  cnf(a11, assumption,
% 0.11/0.33  	X9 = X11).
% 0.11/0.33  cnf(c18, plain,
% 0.11/0.33  	~divides(X8,X9),
% 0.11/0.33  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])).
% 0.11/0.33  cnf(c19, plain,
% 0.11/0.33  	less(X10,X11) | ~less(X10,X12),
% 0.11/0.33  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])).
% 0.11/0.33  
% 0.11/0.33  cnf(c20, plain,
% 0.11/0.33  	~less(a,d)).
% 0.11/0.33  cnf(a12, assumption,
% 0.11/0.33  	X10 = a).
% 0.11/0.33  cnf(a13, assumption,
% 0.11/0.33  	X11 = d).
% 0.11/0.33  cnf(c21, plain,
% 0.11/0.33  	~less(X10,X12),
% 0.11/0.33  	inference(predicate_reduction, [assumptions([a12, a13])], [c19, c20])).
% 0.11/0.33  
% 0.11/0.33  cnf(c22, plain,
% 0.11/0.33  	less(X7,X6)).
% 0.11/0.33  cnf(a14, assumption,
% 0.11/0.33  	X10 = X7).
% 0.11/0.33  cnf(a15, assumption,
% 0.11/0.33  	X12 = X6).
% 0.11/0.33  cnf(c23, plain,
% 0.11/0.33  	$false,
% 0.11/0.33  	inference(predicate_reduction, [assumptions([a14, a15])], [c21, c22])).
% 0.11/0.33  
% 0.11/0.33  cnf(c24, axiom,
% 0.11/0.33  	divides(b,d)).
% 0.11/0.33  cnf(a16, assumption,
% 0.11/0.33  	X8 = b).
% 0.11/0.33  cnf(a17, assumption,
% 0.11/0.33  	X9 = d).
% 0.11/0.33  cnf(c25, plain,
% 0.11/0.33  	$false,
% 0.11/0.33  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c18, c24])).
% 0.11/0.33  cnf(c26, plain,
% 0.11/0.33  	$false,
% 0.11/0.33  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c18, c24])).
% 0.11/0.33  
% 0.11/0.33  cnf(c27, plain,
% 0.11/0.33  	$false,
% 0.11/0.33  	inference(constraint_solving, [
% 0.11/0.33  		bind(X0, a),
% 0.11/0.33  		bind(X1, d),
% 0.11/0.33  		bind(X2, predecessor_of_1st_minus_2nd(X6,X7)),
% 0.11/0.33  		bind(X3, add(successor(X2),X0)),
% 0.11/0.33  		bind(X4, d),
% 0.11/0.33  		bind(X5, b),
% 0.11/0.33  		bind(X6, b),
% 0.11/0.33  		bind(X7, a),
% 0.11/0.33  		bind(X8, b),
% 0.11/0.33  		bind(X9, d),
% 0.11/0.33  		bind(X10, a),
% 0.11/0.33  		bind(X11, d),
% 0.11/0.33  		bind(X12, b)
% 0.11/0.33  	],
% 0.11/0.33  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])).
% 0.11/0.33  
% 0.11/0.33  % SZS output end IncompleteProof
%------------------------------------------------------------------------------