↑ Up

Fiesta---2.UNS-CRf.s

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

% Computer : n022.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:07 EDT 2022

% Result   : Unsatisfiable 1.74s 2.12s
% Output   : CNFRefutation 1.74s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : GRP178-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12  % Command  : fiesta-wrapper %s
% 0.13/0.34  % Computer : n022.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 Jun 13 07:27:48 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 1.74/2.12  Theorem Proved.
% 1.74/2.12  % SZS status Unsatisfiable
% 1.74/2.12  % SZS output start CNFRefutation
% 1.74/2.12  [1=axiom,[],
% 1.74/2.12  			greatest_lower_bound(a,b) 	= identity].
% 1.74/2.12  [2=axiom,[],
% 1.74/2.12  			least_upper_bound(identity,c) 	= c].
% 1.74/2.12  [5=axiom,[],
% 1.74/2.12  			multiply(greatest_lower_bound(X10,X11),X12) 	= greatest_lower_bound(multiply(X10,X12),multiply(X11,X12))].
% 1.74/2.12  [7=axiom,[],
% 1.74/2.12  			multiply(X10,greatest_lower_bound(X11,X12)) 	= greatest_lower_bound(multiply(X10,X11),multiply(X10,X12))].
% 1.74/2.12  [8=axiom,[],
% 1.74/2.12  			multiply(X10,least_upper_bound(X11,X12)) 	= least_upper_bound(multiply(X10,X11),multiply(X10,X12))].
% 1.74/2.12  [9=axiom,[],
% 1.74/2.12  			greatest_lower_bound(X10,least_upper_bound(X10,X11)) 	= X10].
% 1.74/2.12  [14=axiom,[],
% 1.74/2.12  			greatest_lower_bound(greatest_lower_bound(X10,X11),X12) 	= greatest_lower_bound(X10,greatest_lower_bound(X11,X12))].
% 1.74/2.12  [15=axiom,[],
% 1.74/2.12  			least_upper_bound(X10,X11) 	= least_upper_bound(X11,X10)].
% 1.74/2.12  [16=demod(2),[15],
% 1.74/2.12  			least_upper_bound(c,identity) 	= c].
% 1.74/2.12  [19=axiom,[],
% 1.74/2.12  			greatest_lower_bound(X10,X11) 	= greatest_lower_bound(X11,X10)].
% 1.74/2.12  [20=demod(1),[19],
% 1.74/2.12  			greatest_lower_bound(b,a) 	= identity].
% 1.74/2.12  [21=axiom,[],
% 1.74/2.12  			multiply(multiply(X10,X11),X12) 	= multiply(X10,multiply(X11,X12))].
% 1.74/2.12  [22=axiom,[],
% 1.74/2.12  			multiply(inverse(X10),X10) 	= identity].
% 1.74/2.12  [23=axiom,[],
% 1.74/2.12  			multiply(identity,X10) 	= X10].
% 1.74/2.12  [24=axiom,[],
% 1.74/2.12  			thtop(X10,X10) 	= thmfalse].
% 1.74/2.12  [25=axiom,[19],
% 1.74/2.12  			thtop(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(c,a)) 	= thmtrue].
% 1.74/2.12  [26=param(5,20),[23],
% 1.74/2.12  			greatest_lower_bound(multiply(b,X10),multiply(a,X10)) 	= X10].
% 1.74/2.12  [30=param(7,20),[],
% 1.74/2.12  			multiply(X10,identity) 	= greatest_lower_bound(multiply(X10,b),multiply(X10,a))].
% 1.74/2.12  [32=param(8,16),[30],
% 1.74/2.12  			least_upper_bound(multiply(X10,c),greatest_lower_bound(multiply(X10,b),multiply(X10,a))) 	= multiply(X10,c)].
% 1.74/2.12  [55=param(14,19),[14],
% 1.74/2.12  			greatest_lower_bound(X10,greatest_lower_bound(X11,X12)) 	= greatest_lower_bound(X11,greatest_lower_bound(X10,X12))].
% 1.74/2.12  [64=param(21,22),[23],
% 1.74/2.12  			multiply(inverse(X11),multiply(X11,X10)) 	= X10].
% 1.74/2.12  [100=param(64,22),[30],
% 1.74/2.12  			greatest_lower_bound(multiply(inverse(inverse(X10)),b),multiply(inverse(inverse(X10)),a)) 	= X10].
% 1.74/2.12  [102=param(64,64),[],
% 1.74/2.12  			multiply(inverse(inverse(X10)),X11) 	= multiply(X10,X11)].
% 1.74/2.12  [103=demod(100),[102,102],
% 1.74/2.12  			greatest_lower_bound(multiply(X10,b),multiply(X10,a)) 	= X10].
% 1.74/2.12  [104=demod(32),[103,15],
% 1.74/2.12  			least_upper_bound(X10,multiply(X10,c)) 	= multiply(X10,c)].
% 1.74/2.12  [115=param(9,104),[],
% 1.74/2.12  			greatest_lower_bound(X10,multiply(X10,c)) 	= X10].
% 1.74/2.12  [433=param(55,26),[],
% 1.74/2.12  			greatest_lower_bound(multiply(b,X11),greatest_lower_bound(X10,multiply(a,X11))) 	= greatest_lower_bound(X10,X11)].
% 1.74/2.12  [7542=param(433,115),[19,19],
% 1.74/2.12  			greatest_lower_bound(a,multiply(b,c)) 	= greatest_lower_bound(c,a)].
% 1.74/2.12  [7553=param(25,7542),[24],
% 1.74/2.12  			thmtrue 	= thmfalse].
% 1.74/2.12  % SZS output end CNFRefutation
% 1.74/2.12  Space:   9119 KB 
%------------------------------------------------------------------------------