↑ Up

Fiesta---2.UNS-CRf.s

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

% Computer : n016.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:00 EDT 2022

% Result   : Unsatisfiable 0.43s 1.05s
% Output   : CNFRefutation 0.43s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : GRP166-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12  % Command  : fiesta-wrapper %s
% 0.13/0.33  % Computer : n016.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon Jun 13 19:40:30 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.43/1.05  Theorem Proved.
% 0.43/1.05  % SZS status Unsatisfiable
% 0.43/1.05  % SZS output start CNFRefutation
% 0.43/1.05  [1=axiom,[],
% 0.43/1.05  			greatest_lower_bound(b,identity) 	= identity].
% 0.43/1.05  [5=axiom,[],
% 0.43/1.05  			multiply(X10,greatest_lower_bound(X11,X12)) 	= greatest_lower_bound(multiply(X10,X11),multiply(X10,X12))].
% 0.43/1.05  [14=axiom,[],
% 0.43/1.05  			greatest_lower_bound(X10,X11) 	= greatest_lower_bound(X11,X10)].
% 0.43/1.05  [15=axiom,[],
% 0.43/1.05  			multiply(multiply(X10,X11),X12) 	= multiply(X10,multiply(X11,X12))].
% 0.43/1.05  [16=axiom,[],
% 0.43/1.05  			multiply(inverse(X10),X10) 	= identity].
% 0.43/1.05  [17=axiom,[],
% 0.43/1.05  			multiply(identity,X10) 	= X10].
% 0.43/1.05  [18=axiom,[],
% 0.43/1.05  			thtop(X10,X10) 	= thmfalse].
% 0.43/1.05  [19=axiom,[],
% 0.43/1.05  			thtop(greatest_lower_bound(a,multiply(a,b)),a) 	= thmtrue].
% 0.43/1.05  [25=param(5,1),[],
% 0.43/1.05  			greatest_lower_bound(multiply(X10,b),multiply(X10,identity)) 	= multiply(X10,identity)].
% 0.43/1.05  [74=param(15,16),[17],
% 0.43/1.05  			multiply(inverse(X11),multiply(X11,X10)) 	= X10].
% 0.43/1.05  [84=param(74,16),[],
% 0.43/1.05  			multiply(inverse(inverse(X10)),identity) 	= X10].
% 0.43/1.05  [86=param(74,74),[],
% 0.43/1.05  			multiply(inverse(inverse(X10)),X11) 	= multiply(X10,X11)].
% 0.43/1.05  [87=demod(84),[86],
% 0.43/1.05  			multiply(X10,identity) 	= X10].
% 0.43/1.05  [92=demod(25),[87,14,87],
% 0.43/1.05  			greatest_lower_bound(X10,multiply(X10,b)) 	= X10].
% 0.43/1.05  [104=param(19,92),[18],
% 0.43/1.05  			thmtrue 	= thmfalse].
% 0.43/1.05  % SZS output end CNFRefutation
% 0.43/1.05  Space:     72 KB 
%------------------------------------------------------------------------------