TSTP Solution File: GRP172-1 by Waldmeister---710
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : GRP172-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : woody %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 12:25:06 EDT 2022
% Result : Unsatisfiable 0.55s 0.97s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP172-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.00/0.12 % Command : woody %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.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 13:36:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.55/0.97 ********************************************************************************
% 0.55/0.97 * W A L D M E I S T E R \| \ / \|/ *
% 0.55/0.97 * |/ | \/ | *
% 0.55/0.97 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.55/0.97 * A. Jaeger and B. Loechner | | *
% 0.55/0.97 * <waldmeister@informatik.uni-kl.de> | *
% 0.55/0.97 ********************************************************************************
% 0.55/0.97
% 0.55/0.97
% 0.55/0.97 Goals:
% 0.55/0.97 ------
% 0.55/0.97
% 0.55/0.97 ( 1) greatest_lower_bound(identity,multiply(a,b)) ?=? identity
% 0.55/0.97
% 0.55/0.97 Detected structure: VerbandsgeordneteGruppe
% 0.55/0.97 ********************************************************************************
% 0.55/0.97 ****************************** COMPLETION - PROOF ******************************
% 0.55/0.97 ********************************************************************************
% 0.55/0.97
% 0.55/0.97 joined goal: 1 greatest_lower_bound(identity,multiply(a,b)) ?= identity to greatest_lower_bound(identity,b)
% 0.55/0.97 goal joined
% 0.55/0.97 % SZS status Unsatisfiable
% 0.55/0.97 #START OF PROOF
% 0.55/0.97 % SZS output start CNFRefutation
% 0.55/0.97 cnf('0.1.0.0',axiom,
% 0.55/0.97 ( X1 = multiply(identity,X1) ),
% 0.55/0.97 file('/tmp/WALDMEISTER_11308_n010')).
% 0.55/0.97 cnf('0.1.1.0',plain,
% 0.55/0.97 ( X1 = multiply(identity,X1) ),
% 0.55/0.97 inference(weigh,[status(thm)],['0.1.0.0']),
% 0.55/0.97 [weight('<0,0,0,[0,0,0,1]>')]).
% 0.55/0.97 cnf('0.1.2.0',plain,
% 0.55/0.97 ( multiply(identity,X1) = X1 ),
% 0.55/0.98 inference(orient,[status(thm)],['0.1.1.0',theory(equality)]),
% 0.55/0.98 [x,rule_1]).
% 0.55/0.98 cnf('0.3.0.0',axiom,
% 0.55/0.98 ( X1 = greatest_lower_bound(X1,least_upper_bound(X1,X2)) ),
% 0.55/0.98 file('/tmp/WALDMEISTER_11308_n010')).
% 0.55/0.98 cnf('0.3.1.0',plain,
% 0.55/0.98 ( X1 = greatest_lower_bound(X1,least_upper_bound(X1,X2)) ),
% 0.55/0.98 inference(weigh,[status(thm)],['0.3.0.0']),
% 0.55/0.98 [weight('<2,0,0,[0,0,0,3]>')]).
% 0.55/0.98 cnf('0.3.2.0',plain,
% 0.55/0.98 ( greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1 ),
% 0.55/0.98 inference(orient,[status(thm)],['0.3.1.0',theory(equality)]),
% 0.55/0.98 [x,rule_3]).
% 0.55/0.98 cnf('0.5.0.0',axiom,
% 0.55/0.98 ( X1 = least_upper_bound(X1,greatest_lower_bound(X1,X2)) ),
% 0.55/0.98 file('/tmp/WALDMEISTER_11308_n010')).
% 0.55/0.98 cnf('0.5.1.0',plain,
% 0.55/0.98 ( X1 = least_upper_bound(X1,greatest_lower_bound(X1,X2)) ),
% 0.55/0.98 inference(weigh,[status(thm)],['0.5.0.0']),
% 0.55/0.98 [weight('<4,0,0,[0,0,0,5]>')]).
% 0.55/0.98 cnf('0.5.2.0',plain,
% 0.55/0.98 ( least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1 ),
% 0.55/0.98 inference(orient,[status(thm)],['0.5.1.0',theory(equality)]),
% 0.55/0.98 [x,rule_5]).
% 0.55/0.98 cnf('0.10.0.0',axiom,
% 0.55/0.98 ( multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.55/0.98 file('/tmp/WALDMEISTER_11308_n010')).
% 0.55/0.98 cnf('0.10.1.0',plain,
% 0.55/0.98 ( multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.55/0.98 inference(weigh,[status(thm)],['0.10.0.0']),
% 0.55/0.98 [weight('<9,0,0,[0,0,0,10]>')]).
% 0.55/0.98 cnf('0.10.2.0',plain,
% 0.55/0.98 ( multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.55/0.98 inference(orient,[status(thm)],['0.10.1.0',theory(equality)]),
% 0.55/0.98 [u,rule_10]).
% 0.55/0.98 cnf('0.12.0.0',axiom,
% 0.55/0.98 ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.55/0.98 file('/tmp/WALDMEISTER_11308_n010')).
% 0.55/0.98 cnf('0.12.1.0',plain,
% 0.55/0.98 ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.55/0.98 inference(weigh,[status(thm)],['0.12.0.0']),
% 0.55/0.98 [weight('<11,0,0,[0,0,0,12]>')]).
% 0.55/0.98 cnf('0.12.2.0',plain,
% 0.55/0.98 ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.55/0.98 inference(activate,[status(thm)],['0.12.1.0']),
% 0.55/0.98 [equation_1]).
% 0.55/0.98 cnf('0.13.0.0',axiom,
% 0.55/0.98 ( greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3) ),
% 0.55/0.98 file('/tmp/WALDMEISTER_11308_n010')).
% 0.55/0.98 cnf('0.13.1.0',plain,
% 0.55/0.98 ( greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3) ),
% 0.55/0.98 inference(weigh,[status(thm)],['0.13.0.0']),
% 0.55/0.98 [weight('<12,0,0,[0,0,0,13]>')]).
% 0.55/0.98 cnf('0.13.2.0',plain,
% 0.55/0.98 ( greatest_lower_bound(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) ),
% 0.55/0.98 inference(orient,[status(thm)],['0.13.1.0',theory(equality)]),
% 0.55/0.98 [x,rule_12]).
% 0.55/0.98 cnf('0.14.0.0',axiom,
% 0.55/0.98 ( greatest_lower_bound(identity,a) = identity ),
% 0.55/0.98 file('/tmp/WALDMEISTER_11308_n010')).
% 0.55/0.98 cnf('0.14.1.0',plain,
% 0.55/0.98 ( greatest_lower_bound(identity,a) = identity ),
% 0.55/0.98 inference(weigh,[status(thm)],['0.14.0.0']),
% 0.55/0.98 [weight('<13,0,0,[0,0,0,14]>')]).
% 0.55/0.98 cnf('0.14.1.1',plain,
% 0.55/0.98 ( greatest_lower_bound(a,identity) = identity ),
% 0.55/0.98 inference(reduction,[status(thm)],['0.14.1.0','0.12.2.0',theory(equality)]),
% 0.55/0.98 [pos('L','L')]).
% 0.55/0.98 cnf('0.14.2.0',plain,
% 0.55/0.98 ( greatest_lower_bound(a,identity) = identity ),
% 0.55/0.98 inference(orient,[status(thm)],['0.14.1.1',theory(equality)]),
% 0.55/0.98 [u,rule_13]).
% 0.55/0.98 cnf('0.15.0.0',axiom,
% 0.55/0.98 ( greatest_lower_bound(identity,b) = identity ),
% 0.55/0.98 file('/tmp/WALDMEISTER_11308_n010')).
% 0.55/0.98 cnf('0.15.1.0',plain,
% 0.55/0.98 ( greatest_lower_bound(identity,b) = identity ),
% 0.55/0.98 inference(weigh,[status(thm)],['0.15.0.0']),
% 0.55/0.98 [weight('<14,0,0,[0,0,0,15]>')]).
% 0.55/0.98 cnf('0.15.1.1',plain,
% 0.55/0.98 ( greatest_lower_bound(b,identity) = identity ),
% 0.55/0.98 inference(reduction,[status(thm)],['0.15.1.0','0.12.2.0',theory(equality)]),
% 0.55/0.98 [pos('L','L')]).
% 0.55/0.98 cnf('0.15.2.0',plain,
% 0.55/0.98 ( greatest_lower_bound(b,identity) = identity ),
% 0.55/0.98 inference(orient,[status(thm)],['0.15.1.1',theory(equality)]),
% 0.55/0.98 [u,rule_14]).
% 0.55/0.98 cnf('0.16.0.0',axiom,
% 0.55/0.98 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.55/0.98 file('/tmp/WALDMEISTER_11308_n010')).
% 0.55/0.98 cnf('0.16.1.0',plain,
% 0.55/0.98 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.55/0.98 inference(weigh,[status(thm)],['0.16.0.0']),
% 0.55/0.98 [weight('<15,0,0,[0,0,0,16]>')]).
% 0.55/0.98 cnf('0.16.2.0',plain,
% 0.55/0.98 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.55/0.98 inference(activate,[status(thm)],['0.16.1.0']),
% 0.55/0.98 [equation_2]).
% 0.55/0.98 cnf('0.18.0.0',plain,
% 0.55/0.98 ( a = least_upper_bound(a,identity) ),
% 0.55/0.98 inference(cp,[status(thm)],['0.5.2.0','0.14.2.0',theory(equality)]),
% 0.55/0.98 [pos('L.2','L')]).
% 0.55/0.98 cnf('0.18.1.0',plain,
% 0.55/0.98 ( a = least_upper_bound(a,identity) ),
% 0.55/0.98 inference(weigh,[status(thm)],['0.18.0.0']),
% 0.55/0.98 [weight('<19,14,5,[0,0,0,2]>')]).
% 0.55/0.98 cnf('0.18.2.0',plain,
% 0.55/0.98 ( least_upper_bound(a,identity) = a ),
% 0.55/0.98 inference(orient,[status(thm)],['0.18.1.0',theory(equality)]),
% 0.55/0.98 [x,rule_16]).
% 0.55/0.98 cnf('1.0.0.0',conjecture,
% 0.55/0.98 ( greatest_lower_bound(identity,multiply(a,b)) = identity ),
% 0.55/0.98 file('/tmp/WALDMEISTER_11308_n010',conjecture_1)).
% 0.55/0.98 cnf('1.0.0.1',plain,
% 0.55/0.98 ( greatest_lower_bound(greatest_lower_bound(a,identity),multiply(a,b)) = identity ),
% 0.55/0.98 inference(reduction,[status(thm)],['1.0.0.0','0.14.2.0',theory(equality)]),
% 0.55/0.98 [pos('L.1','R')]).
% 0.55/0.98 cnf('1.0.0.2',plain,
% 0.55/0.98 ( greatest_lower_bound(greatest_lower_bound(identity,a),multiply(a,b)) = identity ),
% 0.55/0.98 inference(reduction,[status(thm)],['1.0.0.1','0.12.2.0',theory(equality)]),
% 0.55/0.98 [pos('L.1','L')]).
% 0.55/0.98 cnf('1.0.0.3',plain,
% 0.55/0.98 ( greatest_lower_bound(greatest_lower_bound(identity,a),multiply(a,b)) = greatest_lower_bound(b,identity) ),
% 0.55/0.98 inference(reduction,[status(thm)],['1.0.0.2','0.15.2.0',theory(equality)]),
% 0.55/0.98 [pos('R','R')]).
% 0.55/0.98 cnf('1.0.0.4',plain,
% 0.55/0.98 ( greatest_lower_bound(greatest_lower_bound(greatest_lower_bound(b,identity),a),multiply(a,b)) = greatest_lower_bound(b,identity) ),
% 0.55/0.98 inference(reduction,[status(thm)],['1.0.0.3','0.15.2.0',theory(equality)]),
% 0.55/0.98 [pos('L.1.1','R')]).
% 0.55/0.98 cnf('1.0.0.5',plain,
% 0.55/0.98 ( greatest_lower_bound(greatest_lower_bound(greatest_lower_bound(b,identity),a),multiply(a,b)) = greatest_lower_bound(identity,b) ),
% 0.55/0.98 inference(reduction,[status(thm)],['1.0.0.4','0.12.2.0',theory(equality)]),
% 0.55/0.98 [pos('R','L')]).
% 0.55/0.98 cnf('1.0.0.6',plain,
% 0.55/0.98 ( greatest_lower_bound(greatest_lower_bound(b,greatest_lower_bound(identity,a)),multiply(a,b)) = greatest_lower_bound(identity,b) ),
% 0.55/0.98 inference(reduction,[status(thm)],['1.0.0.5','0.13.2.0',theory(equality)]),
% 0.55/0.98 [pos('L.1','L')]).
% 0.55/0.98 cnf('1.0.0.7',plain,
% 0.55/0.98 ( greatest_lower_bound(greatest_lower_bound(greatest_lower_bound(identity,a),b),multiply(a,b)) = greatest_lower_bound(identity,b) ),
% 0.55/0.98 inference(reduction,[status(thm)],['1.0.0.6','0.12.2.0',theory(equality)]),
% 0.55/0.98 [pos('L.1','L')]).
% 0.55/0.98 cnf('1.0.0.8',plain,
% 0.55/0.98 ( greatest_lower_bound(greatest_lower_bound(identity,a),greatest_lower_bound(b,multiply(a,b))) = greatest_lower_bound(identity,b) ),
% 0.55/0.98 inference(reduction,[status(thm)],['1.0.0.7','0.13.2.0',theory(equality)]),
% 0.55/0.98 [pos('L','L')]).
% 0.55/0.98 cnf('1.0.0.9',plain,
% 0.55/0.98 ( greatest_lower_bound(greatest_lower_bound(b,multiply(a,b)),greatest_lower_bound(identity,a)) = greatest_lower_bound(identity,b) ),
% 0.55/0.98 inference(reduction,[status(thm)],['1.0.0.8','0.12.2.0',theory(equality)]),
% 0.55/0.98 [pos('L','L')]).
% 0.55/0.98 cnf('1.0.0.10',plain,
% 0.55/0.98 ( greatest_lower_bound(greatest_lower_bound(b,multiply(least_upper_bound(a,identity),b)),greatest_lower_bound(identity,a)) = greatest_lower_bound(identity,b) ),
% 0.55/0.98 inference(reduction,[status(thm)],['1.0.0.9','0.18.2.0',theory(equality)]),
% 0.55/0.98 [pos('L.1.2.1','R')]).
% 0.55/0.98 cnf('1.0.0.11',plain,
% 0.55/0.98 ( greatest_lower_bound(greatest_lower_bound(b,multiply(least_upper_bound(identity,a),b)),greatest_lower_bound(identity,a)) = greatest_lower_bound(identity,b) ),
% 0.55/0.98 inference(reduction,[status(thm)],['1.0.0.10','0.16.2.0',theory(equality)]),
% 0.55/0.98 [pos('L.1.2.1','L')]).
% 0.55/0.98 cnf('1.0.0.12',plain,
% 0.55/0.98 ( greatest_lower_bound(greatest_lower_bound(b,multiply(least_upper_bound(identity,a),b)),greatest_lower_bound(a,identity)) = greatest_lower_bound(identity,b) ),
% 0.55/0.98 inference(reduction,[status(thm)],['1.0.0.11','0.12.2.0',theory(equality)]),
% 0.55/0.98 [pos('L.2','L')]).
% 0.55/0.98 cnf('1.0.0.13',plain,
% 0.55/0.98 ( greatest_lower_bound(greatest_lower_bound(a,identity),greatest_lower_bound(b,multiply(least_upper_bound(identity,a),b))) = greatest_lower_bound(identity,b) ),
% 0.55/0.98 inference(reduction,[status(thm)],['1.0.0.12','0.12.2.0',theory(equality)]),
% 0.55/0.98 [pos('L','L')]).
% 0.55/0.98 cnf('1.0.0.14',plain,
% 0.55/0.98 ( greatest_lower_bound(greatest_lower_bound(a,identity),greatest_lower_bound(b,least_upper_bound(multiply(identity,b),multiply(a,b)))) = greatest_lower_bound(identity,b) ),
% 0.55/0.98 inference(reduction,[status(thm)],['1.0.0.13','0.10.2.0',theory(equality)]),
% 0.55/0.98 [pos('L.2.2','L')]).
% 0.55/0.98 cnf('1.0.0.15',plain,
% 0.55/0.98 ( greatest_lower_bound(greatest_lower_bound(a,identity),greatest_lower_bound(b,least_upper_bound(multiply(a,b),multiply(identity,b)))) = greatest_lower_bound(identity,b) ),
% 0.55/0.98 inference(reduction,[status(thm)],['1.0.0.14','0.16.2.0',theory(equality)]),
% 0.55/0.98 [pos('L.2.2','L')]).
% 0.55/0.98 cnf('1.0.0.16',plain,
% 0.55/0.98 ( greatest_lower_bound(greatest_lower_bound(a,identity),greatest_lower_bound(b,least_upper_bound(multiply(a,b),b))) = greatest_lower_bound(identity,b) ),
% 0.55/0.98 inference(reduction,[status(thm)],['1.0.0.15','0.1.2.0',theory(equality)]),
% 0.55/0.98 [pos('L.2.2.2','L')]).
% 0.55/0.98 cnf('1.0.0.17',plain,
% 0.55/0.98 ( greatest_lower_bound(identity,greatest_lower_bound(b,least_upper_bound(multiply(a,b),b))) = greatest_lower_bound(identity,b) ),
% 0.55/0.98 inference(reduction,[status(thm)],['1.0.0.16','0.14.2.0',theory(equality)]),
% 0.55/0.98 [pos('L.1','L')]).
% 0.55/0.98 cnf('1.0.0.18',plain,
% 0.55/0.98 ( greatest_lower_bound(identity,greatest_lower_bound(b,least_upper_bound(b,multiply(a,b)))) = greatest_lower_bound(identity,b) ),
% 0.55/0.98 inference(reduction,[status(thm)],['1.0.0.17','0.16.2.0',theory(equality)]),
% 0.55/0.98 [pos('L.2.2','L')]).
% 0.55/0.98 cnf('1.0.0.19',plain,
% 0.55/0.98 ( greatest_lower_bound(identity,b) = greatest_lower_bound(identity,b) ),
% 0.55/0.98 inference(reduction,[status(thm)],['1.0.0.18','0.3.2.0',theory(equality)]),
% 0.55/0.98 [pos('L.2','L')]).
% 0.55/0.98 cnf('1.0.0.20',plain,
% 0.55/0.98 ( $true ),
% 0.55/0.98 inference(trivial,[status(thm)],['1.0.0.19',theory(equality)]),
% 0.55/0.98 [conjecture_1]).
% 0.55/0.98
% 0.55/0.98 Proved Goals:
% 0.55/0.98 No. 1: greatest_lower_bound(identity,multiply(a,b)) ?= identity joined, current: greatest_lower_bound(identity,b) = greatest_lower_bound(identity,b)
% 0.55/0.98 1 goal was specified, which was proved.
% 0.55/0.98 % SZS output end CNFRefutation
% 0.55/0.98 #END OF PROOF
% 0.55/0.98
% 0.55/0.98 Problem WALDMEISTER_11308_n010
% 0.55/0.98 CPs.gen 67
% 0.55/0.98 CPs.reexp 0
% 0.55/0.98 Select 18
% 0.55/0.98 R 16
% 0.55/0.98 E 2
% 0.55/0.98 vsize 6.5M
% 0.55/0.98 rss 3.7M
% 0.55/0.98 process.time 0.003s
% 0.55/0.98 wallclock.time 0.004s
% 0.55/0.98 status S
% 0.55/0.98
% 0.55/0.98
% 0.55/0.98 Waldmeister states: Goal proved.
% 0.55/0.98 % SZS status Unsatisfiable
% 0.55/0.98
% 0.55/0.98 Problem WALDMEISTER_11308_n010
% 0.55/0.98 CPs.gen 0
% 0.55/0.98 CPs.reexp 0
% 0.55/0.98 Select 0
% 0.55/0.98 R 0
% 0.55/0.98 E 0
% 0.55/0.98 vsize 6.0M
% 0.55/0.98 rss 3.2M
% 0.55/0.98 process.time 0.001s
% 0.55/0.98 wallclock.time 0.003s
% 0.55/0.98 status S
%------------------------------------------------------------------------------