TSTP Solution File: PLA017-1 by lazyCoP---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : PLA017-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop

% Computer : n021.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 17:25:39 EDT 2022

% Result   : Unsatisfiable 0.19s 0.36s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : PLA017-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.11  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.11/0.32  % Computer : n021.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 : Tue May 31 23:40:30 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.19/0.36  % SZS status Unsatisfiable
% 0.19/0.36  % SZS output begin IncompleteProof
% 0.19/0.36  cnf(c0, axiom,
% 0.19/0.36  	~holds(on(a,c),X0)).
% 0.19/0.36  cnf(c1, plain,
% 0.19/0.36  	~holds(on(a,c),X0),
% 0.19/0.36  	inference(start, [], [c0])).
% 0.19/0.36  
% 0.19/0.36  cnf(c2, axiom,
% 0.19/0.36  	~holds(clear(X1),X2) | ~holds(holding(X3),X2) | holds(on(X3,X1),do(putdown(X3,X1),X2))).
% 0.19/0.36  cnf(a0, assumption,
% 0.19/0.36  	on(a,c) = on(X3,X1)).
% 0.19/0.36  cnf(a1, assumption,
% 0.19/0.36  	X0 = do(putdown(X3,X1),X2)).
% 0.19/0.36  cnf(c3, plain,
% 0.19/0.36  	$false,
% 0.19/0.36  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.36  cnf(c4, plain,
% 0.19/0.36  	~holds(clear(X1),X2) | ~holds(holding(X3),X2),
% 0.19/0.36  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.19/0.36  
% 0.19/0.36  cnf(c5, axiom,
% 0.19/0.36  	~differ(X4,X5) | ~holds(clear(X4),X6) | holds(clear(X4),do(pickup(X5),X6))).
% 0.19/0.36  cnf(a2, assumption,
% 0.19/0.36  	clear(X1) = clear(X4)).
% 0.19/0.36  cnf(a3, assumption,
% 0.19/0.36  	X2 = do(pickup(X5),X6)).
% 0.19/0.36  cnf(c6, plain,
% 0.19/0.36  	~holds(holding(X3),X2),
% 0.19/0.36  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.19/0.36  cnf(c7, plain,
% 0.19/0.36  	~differ(X4,X5) | ~holds(clear(X4),X6),
% 0.19/0.36  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.19/0.36  
% 0.19/0.36  cnf(c8, axiom,
% 0.19/0.36  	~differ(X7,X8) | differ(X8,X7)).
% 0.19/0.36  cnf(a4, assumption,
% 0.19/0.36  	X4 = X8).
% 0.19/0.36  cnf(a5, assumption,
% 0.19/0.36  	X5 = X7).
% 0.19/0.36  cnf(c9, plain,
% 0.19/0.36  	~holds(clear(X4),X6),
% 0.19/0.36  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.19/0.36  cnf(c10, plain,
% 0.19/0.36  	~differ(X7,X8),
% 0.19/0.36  	inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.19/0.36  
% 0.19/0.36  cnf(c11, axiom,
% 0.19/0.36  	differ(a,c)).
% 0.19/0.36  cnf(a6, assumption,
% 0.19/0.36  	X7 = a).
% 0.19/0.36  cnf(a7, assumption,
% 0.19/0.36  	X8 = c).
% 0.19/0.36  cnf(c12, plain,
% 0.19/0.36  	$false,
% 0.19/0.36  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.19/0.36  cnf(c13, plain,
% 0.19/0.36  	$false,
% 0.19/0.36  	inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.19/0.36  
% 0.19/0.36  cnf(c14, axiom,
% 0.19/0.36  	holds(clear(c),s0)).
% 0.19/0.36  cnf(a8, assumption,
% 0.19/0.36  	clear(X4) = clear(c)).
% 0.19/0.36  cnf(a9, assumption,
% 0.19/0.36  	X6 = s0).
% 0.19/0.36  cnf(c15, plain,
% 0.19/0.36  	$false,
% 0.19/0.36  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])).
% 0.19/0.36  cnf(c16, plain,
% 0.19/0.36  	$false,
% 0.19/0.36  	inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])).
% 0.19/0.36  
% 0.19/0.36  cnf(c17, axiom,
% 0.19/0.36  	~differ(X9,table) | ~holds(clear(X9),X10) | ~holds(empty,X10) | holds(holding(X9),do(pickup(X9),X10))).
% 0.19/0.36  cnf(a10, assumption,
% 0.19/0.36  	holding(X3) = holding(X9)).
% 0.19/0.36  cnf(a11, assumption,
% 0.19/0.36  	X2 = do(pickup(X9),X10)).
% 0.19/0.36  cnf(c18, plain,
% 0.19/0.36  	$false,
% 0.19/0.36  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c6, c17])).
% 0.19/0.36  cnf(c19, plain,
% 0.19/0.36  	~differ(X9,table) | ~holds(clear(X9),X10) | ~holds(empty,X10),
% 0.19/0.36  	inference(strict_predicate_extension, [assumptions([a10, a11])], [c6, c17])).
% 0.19/0.36  
% 0.19/0.36  cnf(c20, axiom,
% 0.19/0.36  	differ(a,table)).
% 0.19/0.36  cnf(a12, assumption,
% 0.19/0.36  	X9 = a).
% 0.19/0.36  cnf(a13, assumption,
% 0.19/0.36  	table = table).
% 0.19/0.36  cnf(c21, plain,
% 0.19/0.36  	~holds(clear(X9),X10) | ~holds(empty,X10),
% 0.19/0.36  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])).
% 0.19/0.36  cnf(c22, plain,
% 0.19/0.36  	$false,
% 0.19/0.36  	inference(strict_predicate_extension, [assumptions([a12, a13])], [c19, c20])).
% 0.19/0.36  
% 0.19/0.36  cnf(c23, axiom,
% 0.19/0.36  	holds(clear(a),s0)).
% 0.19/0.36  cnf(a14, assumption,
% 0.19/0.36  	clear(X9) = clear(a)).
% 0.19/0.36  cnf(a15, assumption,
% 0.19/0.36  	X10 = s0).
% 0.19/0.36  cnf(c24, plain,
% 0.19/0.36  	~holds(empty,X10),
% 0.19/0.36  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c23])).
% 0.19/0.36  cnf(c25, plain,
% 0.19/0.36  	$false,
% 0.19/0.36  	inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c23])).
% 0.19/0.36  
% 0.19/0.36  cnf(c26, axiom,
% 0.19/0.36  	holds(empty,s0)).
% 0.19/0.36  cnf(a16, assumption,
% 0.19/0.36  	empty = empty).
% 0.19/0.36  cnf(a17, assumption,
% 0.19/0.36  	X10 = s0).
% 0.19/0.36  cnf(c27, plain,
% 0.19/0.36  	$false,
% 0.19/0.36  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c24, c26])).
% 0.19/0.36  cnf(c28, plain,
% 0.19/0.36  	$false,
% 0.19/0.36  	inference(strict_predicate_extension, [assumptions([a16, a17])], [c24, c26])).
% 0.19/0.36  
% 0.19/0.36  cnf(c29, plain,
% 0.19/0.36  	$false,
% 0.19/0.36  	inference(constraint_solving, [
% 0.19/0.36  		bind(X0, do(putdown(X3,X1),X2)),
% 0.19/0.36  		bind(X1, c),
% 0.19/0.36  		bind(X2, do(pickup(X5),X6)),
% 0.19/0.36  		bind(X3, a),
% 0.19/0.36  		bind(X4, c),
% 0.19/0.36  		bind(X5, a),
% 0.19/0.36  		bind(X6, s0),
% 0.19/0.36  		bind(X7, a),
% 0.19/0.36  		bind(X8, c),
% 0.19/0.36  		bind(X9, a),
% 0.19/0.36  		bind(X10, s0)
% 0.19/0.36  	],
% 0.19/0.36  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])).
% 0.19/0.36  
% 0.19/0.36  % SZS output end IncompleteProof
%------------------------------------------------------------------------------