TSTP Solution File: GRP173-1 by Waldmeister---710
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : GRP173-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : woody %s
% Computer : n011.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 12:25:06 EDT 2022
% Result : Unsatisfiable 0.63s 1.05s
% Output : CNFRefutation 0.63s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP173-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.12 % Command : woody %s
% 0.12/0.33 % Computer : n011.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 19:12:19 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.63/1.03 ********************************************************************************
% 0.63/1.03 * W A L D M E I S T E R \| \ / \|/ *
% 0.63/1.03 * |/ | \/ | *
% 0.63/1.03 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.63/1.03 * A. Jaeger and B. Loechner | | *
% 0.63/1.03 * <waldmeister@informatik.uni-kl.de> | *
% 0.63/1.03 ********************************************************************************
% 0.63/1.03
% 0.63/1.03
% 0.63/1.03 Goals:
% 0.63/1.03 ------
% 0.63/1.03
% 0.63/1.03 ( 1) identity ?=? a
% 0.63/1.03
% 0.63/1.03 Detected structure: VerbandsgeordneteGruppe
% 0.63/1.03 ********************************************************************************
% 0.63/1.03 ****************************** COMPLETION - PROOF ******************************
% 0.63/1.03 ********************************************************************************
% 0.63/1.03
% 0.63/1.05 joined goal: 1 identity ?= a to a
% 0.63/1.05 goal joined
% 0.63/1.05 % SZS status Unsatisfiable
% 0.63/1.05 #START OF PROOF
% 0.63/1.05 % SZS output start CNFRefutation
% 0.63/1.05 cnf('0.1.0.0',axiom,
% 0.63/1.05 ( X1 = multiply(identity,X1) ),
% 0.63/1.05 file('/tmp/WALDMEISTER_27030_n011')).
% 0.63/1.05 cnf('0.1.1.0',plain,
% 0.63/1.05 ( X1 = multiply(identity,X1) ),
% 0.63/1.05 inference(weigh,[status(thm)],['0.1.0.0']),
% 0.63/1.05 [weight('<0,0,0,[0,0,0,1]>')]).
% 0.63/1.05 cnf('0.1.2.0',plain,
% 0.63/1.05 ( multiply(identity,X1) = X1 ),
% 0.63/1.05 inference(orient,[status(thm)],['0.1.1.0',theory(equality)]),
% 0.63/1.05 [x,rule_1]).
% 0.63/1.05 cnf('0.5.0.0',axiom,
% 0.63/1.05 ( X1 = greatest_lower_bound(X1,least_upper_bound(X1,X2)) ),
% 0.63/1.05 file('/tmp/WALDMEISTER_27030_n011')).
% 0.63/1.05 cnf('0.5.1.0',plain,
% 0.63/1.05 ( X1 = greatest_lower_bound(X1,least_upper_bound(X1,X2)) ),
% 0.63/1.05 inference(weigh,[status(thm)],['0.5.0.0']),
% 0.63/1.05 [weight('<4,0,0,[0,0,0,5]>')]).
% 0.63/1.05 cnf('0.5.2.0',plain,
% 0.63/1.05 ( greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1 ),
% 0.63/1.05 inference(orient,[status(thm)],['0.5.1.0',theory(equality)]),
% 0.63/1.05 [x,rule_5]).
% 0.63/1.05 cnf('0.6.0.0',axiom,
% 0.63/1.05 ( multiply(X1,multiply(X2,X3)) = multiply(multiply(X1,X2),X3) ),
% 0.63/1.05 file('/tmp/WALDMEISTER_27030_n011')).
% 0.63/1.05 cnf('0.6.1.0',plain,
% 0.63/1.05 ( multiply(X1,multiply(X2,X3)) = multiply(multiply(X1,X2),X3) ),
% 0.63/1.05 inference(weigh,[status(thm)],['0.6.0.0']),
% 0.63/1.05 [weight('<5,0,0,[0,0,0,6]>')]).
% 0.63/1.05 cnf('0.6.2.0',plain,
% 0.63/1.05 ( multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)) ),
% 0.63/1.05 inference(orient,[status(thm)],['0.6.1.0',theory(equality)]),
% 0.63/1.05 [x,rule_6]).
% 0.63/1.05 cnf('0.10.0.0',axiom,
% 0.63/1.05 ( multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.63/1.05 file('/tmp/WALDMEISTER_27030_n011')).
% 0.63/1.05 cnf('0.10.1.0',plain,
% 0.63/1.05 ( multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.63/1.05 inference(weigh,[status(thm)],['0.10.0.0']),
% 0.63/1.05 [weight('<9,0,0,[0,0,0,10]>')]).
% 0.63/1.05 cnf('0.10.2.0',plain,
% 0.63/1.05 ( multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.63/1.05 inference(orient,[status(thm)],['0.10.1.0',theory(equality)]),
% 0.63/1.05 [u,rule_10]).
% 0.63/1.05 cnf('0.11.0.0',axiom,
% 0.63/1.05 ( multiply(inverse(X1),X1) = identity ),
% 0.63/1.05 file('/tmp/WALDMEISTER_27030_n011')).
% 0.63/1.05 cnf('0.11.1.0',plain,
% 0.63/1.05 ( multiply(inverse(X1),X1) = identity ),
% 0.63/1.05 inference(weigh,[status(thm)],['0.11.0.0']),
% 0.63/1.05 [weight('<10,0,0,[0,0,0,11]>')]).
% 0.63/1.05 cnf('0.11.2.0',plain,
% 0.63/1.05 ( multiply(inverse(X1),X1) = identity ),
% 0.63/1.05 inference(orient,[status(thm)],['0.11.1.0',theory(equality)]),
% 0.63/1.05 [u,rule_11]).
% 0.63/1.05 cnf('0.12.0.0',axiom,
% 0.63/1.05 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.63/1.05 file('/tmp/WALDMEISTER_27030_n011')).
% 0.63/1.05 cnf('0.12.1.0',plain,
% 0.63/1.05 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.63/1.05 inference(weigh,[status(thm)],['0.12.0.0']),
% 0.63/1.05 [weight('<11,0,0,[0,0,0,12]>')]).
% 0.63/1.05 cnf('0.12.2.0',plain,
% 0.63/1.05 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.63/1.05 inference(activate,[status(thm)],['0.12.1.0']),
% 0.63/1.05 [equation_1]).
% 0.63/1.05 cnf('0.14.0.0',axiom,
% 0.63/1.05 ( least_upper_bound(identity,a) = identity ),
% 0.63/1.05 file('/tmp/WALDMEISTER_27030_n011')).
% 0.63/1.05 cnf('0.14.1.0',plain,
% 0.63/1.05 ( least_upper_bound(identity,a) = identity ),
% 0.63/1.05 inference(weigh,[status(thm)],['0.14.0.0']),
% 0.63/1.05 [weight('<13,0,0,[0,0,0,14]>')]).
% 0.63/1.05 cnf('0.14.1.1',plain,
% 0.63/1.05 ( least_upper_bound(a,identity) = identity ),
% 0.63/1.05 inference(reduction,[status(thm)],['0.14.1.0','0.12.2.0',theory(equality)]),
% 0.63/1.05 [pos('L','L')]).
% 0.63/1.05 cnf('0.14.2.0',plain,
% 0.63/1.05 ( least_upper_bound(a,identity) = identity ),
% 0.63/1.05 inference(orient,[status(thm)],['0.14.1.1',theory(equality)]),
% 0.63/1.05 [u,rule_13]).
% 0.63/1.05 cnf('0.15.0.0',axiom,
% 0.63/1.05 ( least_upper_bound(identity,inverse(a)) = identity ),
% 0.63/1.05 file('/tmp/WALDMEISTER_27030_n011')).
% 0.63/1.05 cnf('0.15.1.0',plain,
% 0.63/1.05 ( least_upper_bound(identity,inverse(a)) = identity ),
% 0.63/1.05 inference(weigh,[status(thm)],['0.15.0.0']),
% 0.63/1.05 [weight('<14,0,0,[0,0,0,15]>')]).
% 0.63/1.05 cnf('0.15.2.0',plain,
% 0.63/1.05 ( least_upper_bound(identity,inverse(a)) = identity ),
% 0.63/1.05 inference(orient,[status(thm)],['0.15.1.0',theory(equality)]),
% 0.63/1.05 [u,rule_14]).
% 0.63/1.05 cnf('0.16.0.0',axiom,
% 0.63/1.05 ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.63/1.05 file('/tmp/WALDMEISTER_27030_n011')).
% 0.63/1.05 cnf('0.16.1.0',plain,
% 0.63/1.05 ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.63/1.05 inference(weigh,[status(thm)],['0.16.0.0']),
% 0.63/1.05 [weight('<15,0,0,[0,0,0,16]>')]).
% 0.63/1.05 cnf('0.16.2.0',plain,
% 0.63/1.05 ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.63/1.05 inference(activate,[status(thm)],['0.16.1.0']),
% 0.63/1.05 [equation_2]).
% 0.63/1.05 cnf('0.18.0.0',plain,
% 0.63/1.05 ( a = greatest_lower_bound(a,identity) ),
% 0.63/1.05 inference(cp,[status(thm)],['0.5.2.0','0.14.2.0',theory(equality)]),
% 0.63/1.05 [pos('L.2','L')]).
% 0.63/1.05 cnf('0.18.1.0',plain,
% 0.63/1.05 ( a = greatest_lower_bound(a,identity) ),
% 0.63/1.05 inference(weigh,[status(thm)],['0.18.0.0']),
% 0.63/1.05 [weight('<19,14,5,[0,0,0,2]>')]).
% 0.63/1.05 cnf('0.18.2.0',plain,
% 0.63/1.05 ( greatest_lower_bound(a,identity) = a ),
% 0.63/1.05 inference(orient,[status(thm)],['0.18.1.0',theory(equality)]),
% 0.63/1.05 [x,rule_16]).
% 0.63/1.05 cnf('0.19.0.0',plain,
% 0.63/1.05 ( X1 = greatest_lower_bound(X1,least_upper_bound(X2,X1)) ),
% 0.63/1.05 inference(cp,[status(thm)],['0.5.2.0','0.12.2.0',theory(equality)]),
% 0.63/1.05 [pos('L.2','L')]).
% 0.63/1.05 cnf('0.19.1.0',plain,
% 0.63/1.05 ( X1 = greatest_lower_bound(X1,least_upper_bound(X2,X1)) ),
% 0.63/1.05 inference(weigh,[status(thm)],['0.19.0.0']),
% 0.63/1.05 [weight('<41,12,5,[0,0,0,2]>')]).
% 0.63/1.05 cnf('0.19.2.0',plain,
% 0.63/1.05 ( greatest_lower_bound(X1,least_upper_bound(X2,X1)) = X1 ),
% 0.63/1.05 inference(orient,[status(thm)],['0.19.1.0',theory(equality)]),
% 0.63/1.05 [x,rule_17]).
% 0.63/1.05 cnf('0.20.0.0',plain,
% 0.63/1.05 ( inverse(a) = greatest_lower_bound(inverse(a),identity) ),
% 0.63/1.05 inference(cp,[status(thm)],['0.19.2.0','0.15.2.0',theory(equality)]),
% 0.63/1.05 [pos('L.2','L')]).
% 0.63/1.05 cnf('0.20.1.0',plain,
% 0.63/1.05 ( inverse(a) = greatest_lower_bound(inverse(a),identity) ),
% 0.63/1.05 inference(weigh,[status(thm)],['0.20.0.0']),
% 0.63/1.05 [weight('<34,19,15,[1,0,0,2]>')]).
% 0.63/1.05 cnf('0.20.1.1',plain,
% 0.63/1.05 ( inverse(a) = greatest_lower_bound(identity,inverse(a)) ),
% 0.63/1.05 inference(reduction,[status(thm)],['0.20.1.0','0.16.2.0',theory(equality)]),
% 0.63/1.05 [pos('R','L')]).
% 0.63/1.05 cnf('0.20.2.0',plain,
% 0.63/1.05 ( greatest_lower_bound(identity,inverse(a)) = inverse(a) ),
% 0.63/1.05 inference(orient,[status(thm)],['0.20.1.1',theory(equality)]),
% 0.63/1.05 [x,rule_18]).
% 0.63/1.05 cnf('0.28.0.0',plain,
% 0.63/1.05 ( greatest_lower_bound(multiply(a,X1),multiply(identity,X1)) = multiply(a,X1) ),
% 0.63/1.05 inference(cp,[status(thm)],['0.10.2.0','0.18.2.0',theory(equality)]),
% 0.63/1.05 [pos('L.1','L')]).
% 0.63/1.05 cnf('0.28.0.1',plain,
% 0.63/1.05 ( greatest_lower_bound(multiply(a,X1),X1) = multiply(a,X1) ),
% 0.63/1.05 inference(reduction,[status(thm)],['0.28.0.0','0.1.2.0',theory(equality)]),
% 0.63/1.05 [pos('L.2','L')]).
% 0.63/1.05 cnf('0.28.1.0',plain,
% 0.63/1.05 ( greatest_lower_bound(multiply(a,X1),X1) = multiply(a,X1) ),
% 0.63/1.05 inference(weigh,[status(thm)],['0.28.0.1']),
% 0.63/1.05 [weight('<53,18,10,[0,0,0,1]>')]).
% 0.63/1.05 cnf('0.28.1.1',plain,
% 0.63/1.05 ( greatest_lower_bound(X1,multiply(a,X1)) = multiply(a,X1) ),
% 0.63/1.05 inference(reduction,[status(thm)],['0.28.1.0','0.16.2.0',theory(equality)]),
% 0.63/1.05 [pos('L','L')]).
% 0.63/1.05 cnf('0.28.2.0',plain,
% 0.63/1.05 ( greatest_lower_bound(X1,multiply(a,X1)) = multiply(a,X1) ),
% 0.63/1.05 inference(orient,[status(thm)],['0.28.1.1',theory(equality)]),
% 0.63/1.05 [u,rule_26]).
% 0.63/1.05 cnf('0.39.0.0',plain,
% 0.63/1.05 ( multiply(inverse(X1),multiply(X1,X2)) = multiply(identity,X2) ),
% 0.63/1.05 inference(cp,[status(thm)],['0.6.2.0','0.11.2.0',theory(equality)]),
% 0.63/1.05 [pos('L.1','L')]).
% 0.63/1.05 cnf('0.39.0.1',plain,
% 0.63/1.05 ( multiply(inverse(X1),multiply(X1,X2)) = X2 ),
% 0.63/1.05 inference(reduction,[status(thm)],['0.39.0.0','0.1.2.0',theory(equality)]),
% 0.63/1.05 [pos('R','L')]).
% 0.63/1.05 cnf('0.39.1.0',plain,
% 0.63/1.05 ( multiply(inverse(X1),multiply(X1,X2)) = X2 ),
% 0.63/1.05 inference(weigh,[status(thm)],['0.39.0.1']),
% 0.63/1.05 [weight('<55,11,6,[0,0,0,1]>')]).
% 0.63/1.05 cnf('0.39.2.0',plain,
% 0.63/1.05 ( multiply(inverse(X1),multiply(X1,X2)) = X2 ),
% 0.63/1.05 inference(orient,[status(thm)],['0.39.1.0',theory(equality)]),
% 0.63/1.05 [u,rule_37]).
% 0.63/1.05 cnf('0.40.0.0',plain,
% 0.63/1.05 ( multiply(X1,X2) = multiply(inverse(inverse(X1)),X2) ),
% 0.63/1.05 inference(cp,[status(thm)],['0.39.2.0','0.39.2.0',theory(equality)]),
% 0.63/1.05 [pos('L.2','L')]).
% 0.63/1.05 cnf('0.40.1.0',plain,
% 0.63/1.05 ( X1 = inverse(inverse(X1)) ),
% 0.63/1.05 inference(weigh,[status(thm)],['0.40.0.0']),
% 0.63/1.05 [weight('<19,39,39,[0,0,0,3]>')]).
% 0.63/1.05 cnf('0.40.2.0',plain,
% 0.63/1.05 ( inverse(inverse(X1)) = X1 ),
% 0.63/1.05 inference(orient,[status(thm)],['0.40.1.0',theory(equality)]),
% 0.63/1.05 [x,rule_38]).
% 0.63/1.05 cnf('0.42.0.0',plain,
% 0.63/1.05 ( identity = multiply(X1,inverse(X1)) ),
% 0.63/1.05 inference(cp,[status(thm)],['0.11.2.0','0.40.2.0',theory(equality)]),
% 0.63/1.05 [pos('L.1','L')]).
% 0.63/1.05 cnf('0.42.1.0',plain,
% 0.63/1.05 ( identity = multiply(X1,inverse(X1)) ),
% 0.63/1.05 inference(weigh,[status(thm)],['0.42.0.0']),
% 0.63/1.05 [weight('<29,40,11,[0,0,0,1]>')]).
% 0.63/1.05 cnf('0.42.2.0',plain,
% 0.63/1.05 ( multiply(X1,inverse(X1)) = identity ),
% 0.63/1.05 inference(orient,[status(thm)],['0.42.1.0',theory(equality)]),
% 0.63/1.05 [x,rule_40]).
% 0.63/1.05 cnf('0.44.0.0',plain,
% 0.63/1.05 ( multiply(a,inverse(a)) = greatest_lower_bound(inverse(a),identity) ),
% 0.63/1.05 inference(cp,[status(thm)],['0.28.2.0','0.42.2.0',theory(equality)]),
% 0.63/1.05 [pos('L.2','L')]).
% 0.63/1.05 cnf('0.44.0.1',plain,
% 0.63/1.05 ( identity = greatest_lower_bound(inverse(a),identity) ),
% 0.63/1.05 inference(reduction,[status(thm)],['0.44.0.0','0.42.2.0',theory(equality)]),
% 0.63/1.05 [pos('L','L')]).
% 0.63/1.05 cnf('0.44.1.0',plain,
% 0.63/1.05 ( identity = greatest_lower_bound(inverse(a),identity) ),
% 0.63/1.05 inference(weigh,[status(thm)],['0.44.0.1']),
% 0.63/1.05 [weight('<29,42,28,[0,0,0,2]>')]).
% 0.63/1.05 cnf('0.44.1.1',plain,
% 0.63/1.05 ( identity = greatest_lower_bound(identity,inverse(a)) ),
% 0.63/1.05 inference(reduction,[status(thm)],['0.44.1.0','0.16.2.0',theory(equality)]),
% 0.63/1.05 [pos('R','L')]).
% 0.63/1.05 cnf('0.44.1.2',plain,
% 0.63/1.05 ( identity = inverse(a) ),
% 0.63/1.05 inference(reduction,[status(thm)],['0.44.1.1','0.20.2.0',theory(equality)]),
% 0.63/1.05 [pos('R','L')]).
% 0.63/1.05 cnf('0.44.2.0',plain,
% 0.63/1.05 ( inverse(a) = identity ),
% 0.63/1.05 inference(orient,[status(thm)],['0.44.1.2',theory(equality)]),
% 0.63/1.05 [x,rule_42]).
% 0.63/1.05 cnf('0.45.0.0',plain,
% 0.63/1.05 ( identity = multiply(identity,a) ),
% 0.63/1.05 inference(cp,[status(thm)],['0.11.2.0','0.44.2.0',theory(equality)]),
% 0.63/1.05 [pos('L.1','L')]).
% 0.63/1.05 cnf('0.45.0.1',plain,
% 0.63/1.05 ( identity = a ),
% 0.63/1.05 inference(reduction,[status(thm)],['0.45.0.0','0.1.2.0',theory(equality)]),
% 0.63/1.05 [pos('R','L')]).
% 0.63/1.05 cnf('0.45.1.0',plain,
% 0.63/1.05 ( identity = a ),
% 0.63/1.05 inference(weigh,[status(thm)],['0.45.0.1']),
% 0.63/1.05 [weight('<5,44,11,[0,0,0,1]>')]).
% 0.63/1.05 cnf('0.45.2.0',plain,
% 0.63/1.05 ( identity = a ),
% 0.63/1.05 inference(orient,[status(thm)],['0.45.1.0',theory(equality)]),
% 0.63/1.05 [u,rule_43]).
% 0.63/1.05 cnf('1.0.0.0',conjecture,
% 0.63/1.05 ( identity = a ),
% 0.63/1.05 file('/tmp/WALDMEISTER_27030_n011',conjecture_1)).
% 0.63/1.05 cnf('1.0.0.1',plain,
% 0.63/1.05 ( a = a ),
% 0.63/1.05 inference(reduction,[status(thm)],['1.0.0.0','0.45.2.0',theory(equality)]),
% 0.63/1.05 [pos('L','L')]).
% 0.63/1.05 cnf('1.0.0.2',plain,
% 0.63/1.05 ( $true ),
% 0.63/1.05 inference(trivial,[status(thm)],['1.0.0.1',theory(equality)]),
% 0.63/1.05 [conjecture_1]).
% 0.63/1.05
% 0.63/1.05 Proved Goals:
% 0.63/1.05 No. 1: identity ?= a joined, current: a = a
% 0.63/1.05 1 goal was specified, which was proved.
% 0.63/1.05 % SZS output end CNFRefutation
% 0.63/1.05 #END OF PROOF
% 0.63/1.05
% 0.63/1.05 Problem WALDMEISTER_27030_n011
% 0.63/1.05 CPs.gen 379
% 0.63/1.05 CPs.reexp 0
% 0.63/1.05 Select 68
% 0.63/1.05 R 43
% 0.63/1.05 E 2
% 0.63/1.05 vsize 6.6M
% 0.63/1.05 rss 3.8M
% 0.63/1.05 process.time 0.019s
% 0.63/1.05 wallclock.time 0.020s
% 0.63/1.05 status S
% 0.63/1.05
% 0.63/1.05
% 0.63/1.05 Waldmeister states: Goal proved.
% 0.63/1.05 % SZS status Unsatisfiable
% 0.63/1.05
% 0.63/1.05 Problem WALDMEISTER_27030_n011
% 0.63/1.05 CPs.gen 0
% 0.63/1.05 CPs.reexp 0
% 0.63/1.05 Select 0
% 0.63/1.05 R 0
% 0.63/1.05 E 0
% 0.63/1.05 vsize 6.0M
% 0.63/1.05 rss 3.2M
% 0.63/1.05 process.time 0.001s
% 0.63/1.05 wallclock.time 0.019s
% 0.63/1.05 status S
%------------------------------------------------------------------------------