↑ Up

lazyCoP---0.1.UNS-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : lazyCoP---0.1
% Problem  : LCL143-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 : n001.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:12 PM UTC 2026

% Result   : Unsatisfiable 3.62s 0.82s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL143-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.11/0.34  % Computer : n001.cluster.edu
% 0.11/0.34  % Model    : x86_64 x86_64
% 0.11/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34  % Memory   : 8046.5625MB
% 0.11/0.34  % OS       : Linux 6.8.0-71-generic
% 0.11/0.34  % CPULimit : 300
% 0.11/0.34  % WCLimit  : 300
% 0.11/0.34  % DateTime : Fri Sep  4 23:49:30 UTC 2026
% 0.11/0.34  % CPUTime  : 
% 3.62/0.82  % SZS status Unsatisfiable
% 3.62/0.82  % SZS output begin IncompleteProof
% 3.62/0.82  cnf(c0, axiom,
% 3.62/0.82  	ordered(x,y)).
% 3.62/0.82  cnf(c1, plain,
% 3.62/0.82  	ordered(x,y),
% 3.62/0.82  	inference(start, [], [c0])).
% 3.62/0.82  
% 3.62/0.82  cnf(c2, axiom,
% 3.62/0.82  	truth = implies(X0,X1) | ~ordered(X0,X1)).
% 3.62/0.82  cnf(a0, assumption,
% 3.62/0.82  	x = X0).
% 3.62/0.82  cnf(a1, assumption,
% 3.62/0.82  	y = X1).
% 3.62/0.82  cnf(c3, plain,
% 3.62/0.82  	$false,
% 3.62/0.82  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 3.62/0.82  cnf(c4, plain,
% 3.62/0.82  	truth = implies(X0,X1),
% 3.62/0.82  	inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 3.62/0.82  
% 3.62/0.82  cnf(c5, axiom,
% 3.62/0.82  	truth = implies(implies(X2,X3),implies(implies(X3,X4),implies(X2,X4)))).
% 3.62/0.82  cnf(a2, assumption,
% 3.62/0.82  	implies(X3,X4) = implies(X0,X1)).
% 3.62/0.82  cnf(a3, assumption,
% 3.62/0.82  	truth = X5).
% 3.62/0.82  cnf(c6, plain,
% 3.62/0.82  	$false,
% 3.62/0.82  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 3.62/0.82  cnf(c7, plain,
% 3.62/0.82  	$false,
% 3.62/0.82  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 3.62/0.82  cnf(c8, plain,
% 3.62/0.82  	truth = implies(implies(X2,X3),implies(X5,implies(X2,X4))),
% 3.62/0.82  	inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 3.62/0.82  
% 3.62/0.82  cnf(c9, axiom,
% 3.62/0.82  	implies(truth,X6) = X6).
% 3.62/0.82  cnf(a4, assumption,
% 3.62/0.82  	implies(X5,implies(X2,X4)) = implies(truth,X6)).
% 3.62/0.82  cnf(c10, plain,
% 3.62/0.82  	$false,
% 3.62/0.82  	inference(strict_function_extension, [assumptions([a4])], [c8, c9])).
% 3.62/0.82  cnf(c11, plain,
% 3.62/0.82  	$false,
% 3.62/0.82  	inference(strict_function_extension, [assumptions([a4])], [c8, c9])).
% 3.62/0.82  cnf(c12, plain,
% 3.62/0.82  	X7 != X6 | truth = implies(implies(X2,X3),X7),
% 3.62/0.82  	inference(strict_function_extension, [assumptions([a4])], [c8, c9])).
% 3.62/0.82  
% 3.62/0.82  cnf(a5, assumption,
% 3.62/0.82  	X7 = X6).
% 3.62/0.82  cnf(c13, plain,
% 3.62/0.82  	truth = implies(implies(X2,X3),X7),
% 3.62/0.82  	inference(reflexivity, [assumptions([a5])], [c12])).
% 3.62/0.82  
% 3.62/0.82  cnf(c14, axiom,
% 3.62/0.82  	ordered(X8,X9) | truth != implies(X8,X9)).
% 3.62/0.82  cnf(a6, assumption,
% 3.62/0.82  	implies(X8,X9) = implies(implies(X2,X3),X7)).
% 3.62/0.82  cnf(a7, assumption,
% 3.62/0.82  	truth = X10).
% 3.62/0.82  cnf(c15, plain,
% 3.62/0.82  	$false,
% 3.62/0.82  	inference(strict_subterm_extension, [assumptions([a6, a7])], [c13, c14])).
% 3.62/0.82  cnf(c16, plain,
% 3.62/0.82  	ordered(X8,X9),
% 3.62/0.82  	inference(strict_subterm_extension, [assumptions([a6, a7])], [c13, c14])).
% 3.62/0.82  cnf(c17, plain,
% 3.62/0.82  	truth != X10,
% 3.62/0.82  	inference(strict_subterm_extension, [assumptions([a6, a7])], [c13, c14])).
% 3.62/0.82  
% 3.62/0.82  cnf(a8, assumption,
% 3.62/0.82  	truth = X10).
% 3.62/0.82  cnf(c18, plain,
% 3.62/0.82  	$false,
% 3.62/0.82  	inference(reflexivity, [assumptions([a8])], [c17])).
% 3.62/0.82  
% 3.62/0.82  cnf(c19, axiom,
% 3.62/0.82  	~ordered(implies(z,x),implies(z,y))).
% 3.62/0.82  cnf(a9, assumption,
% 3.62/0.82  	X8 = implies(z,x)).
% 3.62/0.82  cnf(a10, assumption,
% 3.62/0.82  	X9 = implies(z,y)).
% 3.62/0.82  cnf(c20, plain,
% 3.62/0.82  	$false,
% 3.62/0.82  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c16, c19])).
% 3.62/0.82  cnf(c21, plain,
% 3.62/0.82  	$false,
% 3.62/0.82  	inference(strict_predicate_extension, [assumptions([a9, a10])], [c16, c19])).
% 3.62/0.82  
% 3.62/0.82  cnf(c22, plain,
% 3.62/0.82  	$false,
% 3.62/0.82  	inference(constraint_solving, [
% 3.62/0.82  		bind(X0, x),
% 3.62/0.82  		bind(X1, y),
% 3.62/0.82  		bind(X2, z),
% 3.62/0.82  		bind(X3, x),
% 3.62/0.82  		bind(X4, y),
% 3.62/0.82  		bind(X5, truth),
% 3.62/0.82  		bind(X6, implies(X2,X4)),
% 3.62/0.82  		bind(X7, implies(X2,X4)),
% 3.62/0.82  		bind(X8, implies(X2,X3)),
% 3.62/0.82  		bind(X9, implies(X2,X4)),
% 3.62/0.82  		bind(X10, truth)
% 3.62/0.82  	],
% 3.62/0.82  	[a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10])).
% 3.62/0.82  
% 3.62/0.82  % SZS output end IncompleteProof
%------------------------------------------------------------------------------