↑ Up

Fiesta---2.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Fiesta---2
% Problem  : GRP185-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : dedam
% Command  : fiesta-wrapper %s

% Computer : n013.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 : Sat Jul 16 09:13:12 EDT 2022

% Result   : Unsatisfiable 0.71s 1.11s
% Output   : CNFRefutation 0.71s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : GRP185-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.12  % Command  : fiesta-wrapper %s
% 0.13/0.34  % Computer : n013.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 : Tue Jun 14 08:12:44 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.71/1.11  Theorem Proved.
% 0.71/1.11  % SZS status Unsatisfiable
% 0.71/1.11  % SZS output start CNFRefutation
% 0.71/1.11  [2=axiom,[],
% 0.71/1.11  			multiply(least_upper_bound(X10,X11),X12) 	= least_upper_bound(multiply(X10,X12),multiply(X11,X12))].
% 0.71/1.11  [4=axiom,[],
% 0.71/1.11  			multiply(X10,least_upper_bound(X11,X12)) 	= least_upper_bound(multiply(X10,X11),multiply(X10,X12))].
% 0.71/1.11  [5=axiom,[],
% 0.71/1.11  			greatest_lower_bound(X10,least_upper_bound(X10,X11)) 	= X10].
% 0.71/1.11  [6=axiom,[],
% 0.71/1.11  			least_upper_bound(X10,greatest_lower_bound(X10,X11)) 	= X10].
% 0.71/1.11  [9=axiom,[],
% 0.71/1.11  			least_upper_bound(least_upper_bound(X10,X11),X12) 	= least_upper_bound(X10,least_upper_bound(X11,X12))].
% 0.71/1.11  [11=axiom,[],
% 0.71/1.11  			least_upper_bound(X10,X11) 	= least_upper_bound(X11,X10)].
% 0.71/1.11  [12=axiom,[],
% 0.71/1.11  			greatest_lower_bound(X10,X11) 	= greatest_lower_bound(X11,X10)].
% 0.71/1.11  [13=axiom,[],
% 0.71/1.11  			multiply(multiply(X10,X11),X12) 	= multiply(X10,multiply(X11,X12))].
% 0.71/1.11  [14=axiom,[],
% 0.71/1.11  			multiply(inverse(X10),X10) 	= identity].
% 0.71/1.11  [15=axiom,[],
% 0.71/1.11  			multiply(identity,X10) 	= X10].
% 0.71/1.11  [16=axiom,[],
% 0.71/1.11  			thtop(X10,X10) 	= thmfalse].
% 0.71/1.11  [17=axiom,[11,2,4,4,15,15,11,9,9,2,4,4,15,15,11,9],
% 0.71/1.11  			thtop(least_upper_bound(identity,least_upper_bound(multiply(a,b),least_upper_bound(b,least_upper_bound(identity,least_upper_bound(multiply(a,b),multiply(a,identity)))))),least_upper_bound(b,least_upper_bound(identity,least_upper_bound(multiply(a,b),multiply(a,identity))))) 	= thmtrue].
% 0.71/1.11  [18=param(6,12),[],
% 0.71/1.11  			least_upper_bound(X10,greatest_lower_bound(X11,X10)) 	= X10].
% 0.71/1.11  [20=param(18,5),[11],
% 0.71/1.11  			least_upper_bound(X10,least_upper_bound(X10,X11)) 	= least_upper_bound(X10,X11)].
% 0.71/1.11  [21=param(5,11),[],
% 0.71/1.11  			greatest_lower_bound(X10,least_upper_bound(X11,X10)) 	= X10].
% 0.71/1.11  [29=param(9,11),[],
% 0.71/1.11  			least_upper_bound(X10,least_upper_bound(X11,X12)) 	= least_upper_bound(X12,least_upper_bound(X10,X11))].
% 0.71/1.11  [33=param(21,9),[],
% 0.71/1.11  			greatest_lower_bound(X10,least_upper_bound(X11,least_upper_bound(X12,X10))) 	= X10].
% 0.71/1.11  [53=param(13,14),[15],
% 0.71/1.11  			multiply(inverse(X11),multiply(X11,X10)) 	= X10].
% 0.71/1.11  [55=param(53,14),[],
% 0.71/1.11  			multiply(inverse(inverse(X10)),identity) 	= X10].
% 0.71/1.11  [57=param(53,53),[],
% 0.71/1.11  			multiply(inverse(inverse(X10)),X11) 	= multiply(X10,X11)].
% 0.71/1.11  [58=demod(55),[57],
% 0.71/1.11  			multiply(X10,identity) 	= X10].
% 0.71/1.11  [89=param(18,33),[11],
% 0.71/1.11  			least_upper_bound(X10,least_upper_bound(X11,least_upper_bound(X12,X10))) 	= least_upper_bound(X11,least_upper_bound(X12,X10))].
% 0.71/1.11  [104=param(29,9),[9],
% 0.71/1.11  			least_upper_bound(X10,least_upper_bound(X11,least_upper_bound(X12,X13))) 	= least_upper_bound(X11,least_upper_bound(X12,least_upper_bound(X13,X10)))].
% 0.71/1.11  [106=param(17,29),[58,11,11,104,29,11,89,20,58,11,16],
% 0.71/1.11  			thmtrue 	= thmfalse].
% 0.71/1.11  % SZS output end CNFRefutation
% 0.71/1.11  Space:     94 KB 
%------------------------------------------------------------------------------