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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : SYN120-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 : n004.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 : Thu Jul 21 08:08:21 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SYN120-1 : TPTP v8.1.0. Released v1.1.0.
% 0.13/0.13  % Command  : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34  % Computer : n004.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jul 11 14:02:52 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.36  % SZS status Unsatisfiable
% 0.20/0.36  % SZS output begin IncompleteProof
% 0.20/0.36  cnf(c0, axiom,
% 0.20/0.36  	~l1(e,e)).
% 0.20/0.36  cnf(c1, plain,
% 0.20/0.36  	~l1(e,e),
% 0.20/0.36  	inference(start, [], [c0])).
% 0.20/0.36  
% 0.20/0.36  cnf(c2, axiom,
% 0.20/0.36  	~n0(X0,X1) | l1(X1,X1)).
% 0.20/0.36  cnf(a0, assumption,
% 0.20/0.36  	e = X1).
% 0.20/0.36  cnf(a1, assumption,
% 0.20/0.36  	e = X1).
% 0.20/0.36  cnf(c3, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.36  cnf(c4, plain,
% 0.20/0.36  	~n0(X0,X1),
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.20/0.36  
% 0.20/0.36  cnf(c5, axiom,
% 0.20/0.36  	n0(d,e)).
% 0.20/0.36  cnf(a2, assumption,
% 0.20/0.36  	X0 = d).
% 0.20/0.36  cnf(a3, assumption,
% 0.20/0.36  	X1 = e).
% 0.20/0.36  cnf(c6, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.20/0.36  cnf(c7, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.20/0.36  
% 0.20/0.36  cnf(c8, plain,
% 0.20/0.36  	$false,
% 0.20/0.36  	inference(constraint_solving, [
% 0.20/0.36  		bind(X0, d),
% 0.20/0.36  		bind(X1, e)
% 0.20/0.36  	],
% 0.20/0.36  	[a0, a1, a2, a3])).
% 0.20/0.36  
% 0.20/0.36  % SZS output end IncompleteProof
%------------------------------------------------------------------------------