↑ Up

Fiesta---2.UNS-CRf.s

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

% Computer : n010.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:02 EDT 2022

% Result   : Unsatisfiable 2.47s 2.86s
% Output   : CNFRefutation 2.47s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : GRP168-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.12  % Command  : fiesta-wrapper %s
% 0.12/0.33  % Computer : n010.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jun 13 23:51:39 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 2.47/2.86  Theorem Proved.
% 2.47/2.86  % SZS status Unsatisfiable
% 2.47/2.86  % SZS output start CNFRefutation
% 2.47/2.86  [1=axiom,[],
% 2.47/2.86  			least_upper_bound(a,b) 	= b].
% 2.47/2.86  [3=axiom,[],
% 2.47/2.86  			multiply(least_upper_bound(X10,X11),X12) 	= least_upper_bound(multiply(X10,X12),multiply(X11,X12))].
% 2.47/2.86  [5=axiom,[],
% 2.47/2.86  			multiply(X10,least_upper_bound(X11,X12)) 	= least_upper_bound(multiply(X10,X11),multiply(X10,X12))].
% 2.47/2.86  [12=axiom,[],
% 2.47/2.86  			least_upper_bound(X10,X11) 	= least_upper_bound(X11,X10)].
% 2.47/2.86  [13=demod(1),[12],
% 2.47/2.86  			least_upper_bound(b,a) 	= b].
% 2.47/2.86  [15=axiom,[],
% 2.47/2.86  			multiply(multiply(X10,X11),X12) 	= multiply(X10,multiply(X11,X12))].
% 2.47/2.86  [16=axiom,[],
% 2.47/2.86  			multiply(inverse(X10),X10) 	= identity].
% 2.47/2.86  [17=axiom,[],
% 2.47/2.86  			multiply(identity,X10) 	= X10].
% 2.47/2.86  [18=axiom,[],
% 2.47/2.86  			thtop(X10,X10) 	= thmfalse].
% 2.47/2.86  [19=axiom,[12],
% 2.47/2.86  			thtop(least_upper_bound(multiply(inverse(c),multiply(b,c)),multiply(inverse(c),multiply(a,c))),multiply(inverse(c),multiply(b,c))) 	= thmtrue].
% 2.47/2.86  [20=param(3,13),[],
% 2.47/2.86  			least_upper_bound(multiply(b,X10),multiply(a,X10)) 	= multiply(b,X10)].
% 2.47/2.86  [62=param(15,16),[17],
% 2.47/2.86  			multiply(inverse(X11),multiply(X11,X10)) 	= X10].
% 2.47/2.86  [63=param(62,15),[],
% 2.47/2.86  			multiply(inverse(multiply(X10,X11)),multiply(X10,multiply(X11,X12))) 	= X12].
% 2.47/2.86  [64=param(62,16),[],
% 2.47/2.86  			multiply(inverse(inverse(X10)),identity) 	= X10].
% 2.47/2.86  [66=param(62,62),[],
% 2.47/2.86  			multiply(inverse(inverse(X10)),X11) 	= multiply(X10,X11)].
% 2.47/2.86  [67=demod(64),[66],
% 2.47/2.86  			multiply(X10,identity) 	= X10].
% 2.47/2.86  [70=param(66,16),[],
% 2.47/2.86  			multiply(X10,inverse(X10)) 	= identity].
% 2.47/2.86  [71=param(66,62),[],
% 2.47/2.86  			multiply(X10,multiply(inverse(X10),X11)) 	= X11].
% 2.47/2.86  [72=param(66,67),[67],
% 2.47/2.86  			inverse(inverse(X10)) 	= X10].
% 2.47/2.86  [80=param(70,15),[],
% 2.47/2.86  			multiply(X10,multiply(X11,inverse(multiply(X10,X11)))) 	= identity].
% 2.47/2.86  [438=param(63,70),[67],
% 2.47/2.86  			multiply(inverse(multiply(X10,X11)),X10) 	= inverse(X11)].
% 2.47/2.86  [445=param(438,62),[],
% 2.47/2.86  			multiply(inverse(X10),inverse(X11)) 	= inverse(multiply(X11,X10))].
% 2.47/2.86  [446=param(438,71),[],
% 2.47/2.86  			multiply(inverse(X10),X11) 	= inverse(multiply(inverse(X11),X10))].
% 2.47/2.86  [512=param(62,80),[67],
% 2.47/2.86  			multiply(X11,inverse(multiply(X10,X11))) 	= inverse(X10)].
% 2.47/2.86  [516=param(512,15),[],
% 2.47/2.86  			multiply(X10,inverse(multiply(X11,multiply(X12,X10)))) 	= inverse(multiply(X11,X12))].
% 2.47/2.86  [630=param(446,72),[],
% 2.47/2.86  			multiply(X10,X11) 	= inverse(multiply(inverse(X11),inverse(X10)))].
% 2.47/2.86  [705=param(15,445),[],
% 2.47/2.86  			multiply(inverse(multiply(X10,X11)),X12) 	= multiply(inverse(X11),multiply(inverse(X10),X12))].
% 2.47/2.86  [1162=param(62,516),[],
% 2.47/2.86  			multiply(inverse(X10),inverse(multiply(X11,X12))) 	= inverse(multiply(X11,multiply(X12,X10)))].
% 2.47/2.86  [4004=param(5,20),[],
% 2.47/2.86  			least_upper_bound(multiply(X10,multiply(b,X11)),multiply(X10,multiply(a,X11))) 	= multiply(X10,multiply(b,X11))].
% 2.47/2.86  [4616=param(19,630),[72,705,630,72,1162,72,4004,18],
% 2.47/2.86  			thmtrue 	= thmfalse].
% 2.47/2.86  % SZS output end CNFRefutation
% 2.47/2.86  Space:  11132 KB 
%------------------------------------------------------------------------------