TSTP Solution File: GRP147-1 by Waldmeister---710
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : GRP147-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : woody %s
% Computer : n023.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:24:57 EDT 2022
% Result : Unsatisfiable 0.59s 1.01s
% Output : CNFRefutation 0.59s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP147-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12 % Command : woody %s
% 0.12/0.33 % Computer : n023.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 17:00:06 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.59/1.00 ********************************************************************************
% 0.59/1.00 * W A L D M E I S T E R \| \ / \|/ *
% 0.59/1.00 * |/ | \/ | *
% 0.59/1.00 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.59/1.00 * A. Jaeger and B. Loechner | | *
% 0.59/1.00 * <waldmeister@informatik.uni-kl.de> | *
% 0.59/1.00 ********************************************************************************
% 0.59/1.00
% 0.59/1.00
% 0.59/1.00 Goals:
% 0.59/1.00 ------
% 0.59/1.00
% 0.59/1.00 ( 1) greatest_lower_bound(least_upper_bound(a,b),c) ?=? least_upper_bound(a,b)
% 0.59/1.00
% 0.59/1.00 Detected structure: VerbandsgeordneteGruppe
% 0.59/1.00 ********************************************************************************
% 0.59/1.00 ****************************** COMPLETION - PROOF ******************************
% 0.59/1.00 ********************************************************************************
% 0.59/1.00
% 0.59/1.01 joined goal: 1 greatest_lower_bound(least_upper_bound(a,b),c) ?= least_upper_bound(a,b) to least_upper_bound(b,a)
% 0.59/1.01 goal joined
% 0.59/1.01 % SZS status Unsatisfiable
% 0.59/1.01 #START OF PROOF
% 0.59/1.01 % SZS output start CNFRefutation
% 0.59/1.01 cnf('0.3.0.0',axiom,
% 0.59/1.01 ( X1 = greatest_lower_bound(X1,least_upper_bound(X1,X2)) ),
% 0.59/1.01 file('/tmp/WALDMEISTER_16946_n023')).
% 0.59/1.01 cnf('0.3.1.0',plain,
% 0.59/1.01 ( X1 = greatest_lower_bound(X1,least_upper_bound(X1,X2)) ),
% 0.59/1.01 inference(weigh,[status(thm)],['0.3.0.0']),
% 0.59/1.01 [weight('<2,0,0,[0,0,0,3]>')]).
% 0.59/1.01 cnf('0.3.2.0',plain,
% 0.59/1.01 ( greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1 ),
% 0.59/1.01 inference(orient,[status(thm)],['0.3.1.0',theory(equality)]),
% 0.59/1.01 [x,rule_3]).
% 0.59/1.01 cnf('0.5.0.0',axiom,
% 0.59/1.01 ( X1 = least_upper_bound(X1,greatest_lower_bound(X1,X2)) ),
% 0.59/1.01 file('/tmp/WALDMEISTER_16946_n023')).
% 0.59/1.01 cnf('0.5.1.0',plain,
% 0.59/1.01 ( X1 = least_upper_bound(X1,greatest_lower_bound(X1,X2)) ),
% 0.59/1.01 inference(weigh,[status(thm)],['0.5.0.0']),
% 0.59/1.01 [weight('<4,0,0,[0,0,0,5]>')]).
% 0.59/1.01 cnf('0.5.2.0',plain,
% 0.59/1.01 ( least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1 ),
% 0.59/1.01 inference(orient,[status(thm)],['0.5.1.0',theory(equality)]),
% 0.59/1.01 [x,rule_5]).
% 0.59/1.01 cnf('0.12.0.0',axiom,
% 0.59/1.01 ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.59/1.01 file('/tmp/WALDMEISTER_16946_n023')).
% 0.59/1.01 cnf('0.12.1.0',plain,
% 0.59/1.01 ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.59/1.01 inference(weigh,[status(thm)],['0.12.0.0']),
% 0.59/1.01 [weight('<11,0,0,[0,0,0,12]>')]).
% 0.59/1.01 cnf('0.12.2.0',plain,
% 0.59/1.01 ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.59/1.01 inference(activate,[status(thm)],['0.12.1.0']),
% 0.59/1.01 [equation_1]).
% 0.59/1.01 cnf('0.14.0.0',axiom,
% 0.59/1.01 ( greatest_lower_bound(a,c) = a ),
% 0.59/1.01 file('/tmp/WALDMEISTER_16946_n023')).
% 0.59/1.01 cnf('0.14.1.0',plain,
% 0.59/1.01 ( greatest_lower_bound(a,c) = a ),
% 0.59/1.01 inference(weigh,[status(thm)],['0.14.0.0']),
% 0.59/1.01 [weight('<13,0,0,[0,0,0,14]>')]).
% 0.59/1.01 cnf('0.14.1.1',plain,
% 0.59/1.01 ( greatest_lower_bound(c,a) = a ),
% 0.59/1.01 inference(reduction,[status(thm)],['0.14.1.0','0.12.2.0',theory(equality)]),
% 0.59/1.01 [pos('L','L')]).
% 0.59/1.01 cnf('0.14.2.0',plain,
% 0.59/1.01 ( greatest_lower_bound(c,a) = a ),
% 0.59/1.01 inference(orient,[status(thm)],['0.14.1.1',theory(equality)]),
% 0.59/1.01 [u,rule_13]).
% 0.59/1.01 cnf('0.15.0.0',axiom,
% 0.59/1.01 ( greatest_lower_bound(b,c) = b ),
% 0.59/1.01 file('/tmp/WALDMEISTER_16946_n023')).
% 0.59/1.01 cnf('0.15.1.0',plain,
% 0.59/1.01 ( greatest_lower_bound(b,c) = b ),
% 0.59/1.01 inference(weigh,[status(thm)],['0.15.0.0']),
% 0.59/1.01 [weight('<14,0,0,[0,0,0,15]>')]).
% 0.59/1.01 cnf('0.15.1.1',plain,
% 0.59/1.01 ( greatest_lower_bound(c,b) = b ),
% 0.59/1.01 inference(reduction,[status(thm)],['0.15.1.0','0.12.2.0',theory(equality)]),
% 0.59/1.01 [pos('L','L')]).
% 0.59/1.01 cnf('0.15.2.0',plain,
% 0.59/1.01 ( greatest_lower_bound(c,b) = b ),
% 0.59/1.01 inference(orient,[status(thm)],['0.15.1.1',theory(equality)]),
% 0.59/1.01 [u,rule_14]).
% 0.59/1.01 cnf('0.16.0.0',axiom,
% 0.59/1.01 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.59/1.01 file('/tmp/WALDMEISTER_16946_n023')).
% 0.59/1.01 cnf('0.16.1.0',plain,
% 0.59/1.01 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.59/1.01 inference(weigh,[status(thm)],['0.16.0.0']),
% 0.59/1.01 [weight('<15,0,0,[0,0,0,16]>')]).
% 0.59/1.01 cnf('0.16.2.0',plain,
% 0.59/1.01 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.59/1.01 inference(activate,[status(thm)],['0.16.1.0']),
% 0.59/1.01 [equation_2]).
% 0.59/1.01 cnf('0.17.0.0',axiom,
% 0.59/1.01 ( least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3) ),
% 0.59/1.01 file('/tmp/WALDMEISTER_16946_n023')).
% 0.59/1.01 cnf('0.17.1.0',plain,
% 0.59/1.01 ( least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3) ),
% 0.59/1.01 inference(weigh,[status(thm)],['0.17.0.0']),
% 0.59/1.01 [weight('<16,0,0,[0,0,0,17]>')]).
% 0.59/1.01 cnf('0.17.2.0',plain,
% 0.59/1.01 ( least_upper_bound(least_upper_bound(X1,X2),X3) = least_upper_bound(X1,least_upper_bound(X2,X3)) ),
% 0.59/1.01 inference(orient,[status(thm)],['0.17.1.0',theory(equality)]),
% 0.59/1.01 [x,rule_15]).
% 0.59/1.01 cnf('0.18.0.0',plain,
% 0.59/1.01 ( c = least_upper_bound(c,a) ),
% 0.59/1.01 inference(cp,[status(thm)],['0.5.2.0','0.14.2.0',theory(equality)]),
% 0.59/1.01 [pos('L.2','L')]).
% 0.59/1.01 cnf('0.18.1.0',plain,
% 0.59/1.01 ( c = least_upper_bound(c,a) ),
% 0.59/1.01 inference(weigh,[status(thm)],['0.18.0.0']),
% 0.59/1.01 [weight('<19,14,5,[0,0,0,2]>')]).
% 0.59/1.01 cnf('0.18.2.0',plain,
% 0.59/1.01 ( least_upper_bound(c,a) = c ),
% 0.59/1.01 inference(orient,[status(thm)],['0.18.1.0',theory(equality)]),
% 0.59/1.01 [x,rule_16]).
% 0.59/1.01 cnf('0.19.0.0',plain,
% 0.59/1.01 ( c = least_upper_bound(c,b) ),
% 0.59/1.01 inference(cp,[status(thm)],['0.5.2.0','0.15.2.0',theory(equality)]),
% 0.59/1.01 [pos('L.2','L')]).
% 0.59/1.01 cnf('0.19.1.0',plain,
% 0.59/1.01 ( c = least_upper_bound(c,b) ),
% 0.59/1.01 inference(weigh,[status(thm)],['0.19.0.0']),
% 0.59/1.01 [weight('<19,15,5,[0,0,0,2]>')]).
% 0.59/1.01 cnf('0.19.2.0',plain,
% 0.59/1.01 ( least_upper_bound(c,b) = c ),
% 0.59/1.01 inference(orient,[status(thm)],['0.19.1.0',theory(equality)]),
% 0.59/1.01 [x,rule_17]).
% 0.59/1.01 cnf('1.0.0.0',conjecture,
% 0.59/1.01 ( greatest_lower_bound(least_upper_bound(a,b),c) = least_upper_bound(a,b) ),
% 0.59/1.01 file('/tmp/WALDMEISTER_16946_n023',conjecture_1)).
% 0.59/1.01 cnf('1.0.0.1',plain,
% 0.59/1.01 ( greatest_lower_bound(c,least_upper_bound(a,b)) = least_upper_bound(a,b) ),
% 0.59/1.01 inference(reduction,[status(thm)],['1.0.0.0','0.12.2.0',theory(equality)]),
% 0.59/1.01 [pos('L','L')]).
% 0.59/1.01 cnf('1.0.0.2',plain,
% 0.59/1.01 ( greatest_lower_bound(c,least_upper_bound(a,greatest_lower_bound(c,b))) = least_upper_bound(a,b) ),
% 0.59/1.01 inference(reduction,[status(thm)],['1.0.0.1','0.15.2.0',theory(equality)]),
% 0.59/1.01 [pos('L.2.2','R')]).
% 0.59/1.01 cnf('1.0.0.3',plain,
% 0.59/1.01 ( greatest_lower_bound(c,least_upper_bound(a,greatest_lower_bound(b,c))) = least_upper_bound(a,b) ),
% 0.59/1.01 inference(reduction,[status(thm)],['1.0.0.2','0.12.2.0',theory(equality)]),
% 0.59/1.01 [pos('L.2.2','L')]).
% 0.59/1.01 cnf('1.0.0.4',plain,
% 0.59/1.01 ( greatest_lower_bound(c,least_upper_bound(a,greatest_lower_bound(b,c))) = least_upper_bound(b,a) ),
% 0.59/1.01 inference(reduction,[status(thm)],['1.0.0.3','0.16.2.0',theory(equality)]),
% 0.59/1.01 [pos('R','L')]).
% 0.59/1.01 cnf('1.0.0.5',plain,
% 0.59/1.01 ( greatest_lower_bound(c,least_upper_bound(greatest_lower_bound(b,c),a)) = least_upper_bound(b,a) ),
% 0.59/1.01 inference(reduction,[status(thm)],['1.0.0.4','0.16.2.0',theory(equality)]),
% 0.59/1.01 [pos('L.2','L')]).
% 0.59/1.01 cnf('1.0.0.6',plain,
% 0.59/1.01 ( greatest_lower_bound(least_upper_bound(c,a),least_upper_bound(greatest_lower_bound(b,c),a)) = least_upper_bound(b,a) ),
% 0.59/1.01 inference(reduction,[status(thm)],['1.0.0.5','0.18.2.0',theory(equality)]),
% 0.59/1.01 [pos('L.1','R')]).
% 0.59/1.01 cnf('1.0.0.7',plain,
% 0.59/1.01 ( greatest_lower_bound(least_upper_bound(least_upper_bound(c,b),a),least_upper_bound(greatest_lower_bound(b,c),a)) = least_upper_bound(b,a) ),
% 0.59/1.01 inference(reduction,[status(thm)],['1.0.0.6','0.19.2.0',theory(equality)]),
% 0.59/1.01 [pos('L.1.1','R')]).
% 0.59/1.01 cnf('1.0.0.8',plain,
% 0.59/1.01 ( greatest_lower_bound(least_upper_bound(c,least_upper_bound(b,a)),least_upper_bound(greatest_lower_bound(b,c),a)) = least_upper_bound(b,a) ),
% 0.59/1.01 inference(reduction,[status(thm)],['1.0.0.7','0.17.2.0',theory(equality)]),
% 0.59/1.01 [pos('L.1','L')]).
% 0.59/1.01 cnf('1.0.0.9',plain,
% 0.59/1.01 ( greatest_lower_bound(least_upper_bound(c,least_upper_bound(b,a)),least_upper_bound(a,greatest_lower_bound(b,c))) = least_upper_bound(b,a) ),
% 0.59/1.01 inference(reduction,[status(thm)],['1.0.0.8','0.16.2.0',theory(equality)]),
% 0.59/1.01 [pos('L.2','L')]).
% 0.59/1.01 cnf('1.0.0.10',plain,
% 0.59/1.01 ( greatest_lower_bound(least_upper_bound(c,least_upper_bound(a,b)),least_upper_bound(a,greatest_lower_bound(b,c))) = least_upper_bound(b,a) ),
% 0.59/1.01 inference(reduction,[status(thm)],['1.0.0.9','0.16.2.0',theory(equality)]),
% 0.59/1.01 [pos('L.1.2','L')]).
% 0.59/1.01 cnf('1.0.0.11',plain,
% 0.59/1.01 ( greatest_lower_bound(least_upper_bound(least_upper_bound(a,b),c),least_upper_bound(a,greatest_lower_bound(b,c))) = least_upper_bound(b,a) ),
% 0.59/1.01 inference(reduction,[status(thm)],['1.0.0.10','0.16.2.0',theory(equality)]),
% 0.59/1.01 [pos('L.1','L')]).
% 0.59/1.01 cnf('1.0.0.12',plain,
% 0.59/1.01 ( greatest_lower_bound(least_upper_bound(least_upper_bound(a,b),c),least_upper_bound(a,greatest_lower_bound(c,b))) = least_upper_bound(b,a) ),
% 0.59/1.01 inference(reduction,[status(thm)],['1.0.0.11','0.12.2.0',theory(equality)]),
% 0.59/1.01 [pos('L.2.2','L')]).
% 0.59/1.01 cnf('1.0.0.13',plain,
% 0.59/1.01 ( greatest_lower_bound(least_upper_bound(least_upper_bound(a,b),c),least_upper_bound(greatest_lower_bound(c,b),a)) = least_upper_bound(b,a) ),
% 0.59/1.01 inference(reduction,[status(thm)],['1.0.0.12','0.16.2.0',theory(equality)]),
% 0.59/1.01 [pos('L.2','L')]).
% 0.59/1.01 cnf('1.0.0.14',plain,
% 0.59/1.01 ( greatest_lower_bound(least_upper_bound(least_upper_bound(b,a),c),least_upper_bound(greatest_lower_bound(c,b),a)) = least_upper_bound(b,a) ),
% 0.59/1.01 inference(reduction,[status(thm)],['1.0.0.13','0.16.2.0',theory(equality)]),
% 0.59/1.01 [pos('L.1.1','L')]).
% 0.59/1.01 cnf('1.0.0.15',plain,
% 0.59/1.01 ( greatest_lower_bound(least_upper_bound(least_upper_bound(b,a),c),least_upper_bound(b,a)) = least_upper_bound(b,a) ),
% 0.59/1.01 inference(reduction,[status(thm)],['1.0.0.14','0.15.2.0',theory(equality)]),
% 0.59/1.01 [pos('L.2.1','L')]).
% 0.59/1.01 cnf('1.0.0.16',plain,
% 0.59/1.01 ( greatest_lower_bound(least_upper_bound(b,a),least_upper_bound(least_upper_bound(b,a),c)) = least_upper_bound(b,a) ),
% 0.59/1.01 inference(reduction,[status(thm)],['1.0.0.15','0.12.2.0',theory(equality)]),
% 0.59/1.01 [pos('L','L')]).
% 0.59/1.01 cnf('1.0.0.17',plain,
% 0.59/1.01 ( least_upper_bound(b,a) = least_upper_bound(b,a) ),
% 0.59/1.01 inference(reduction,[status(thm)],['1.0.0.16','0.3.2.0',theory(equality)]),
% 0.59/1.01 [pos('L','L')]).
% 0.59/1.01 cnf('1.0.0.18',plain,
% 0.59/1.01 ( $true ),
% 0.59/1.01 inference(trivial,[status(thm)],['1.0.0.17',theory(equality)]),
% 0.59/1.01 [conjecture_1]).
% 0.59/1.01
% 0.59/1.01 Proved Goals:
% 0.59/1.01 No. 1: greatest_lower_bound(least_upper_bound(a,b),c) ?= least_upper_bound(a,b) joined, current: least_upper_bound(b,a) = least_upper_bound(b,a)
% 0.59/1.01 1 goal was specified, which was proved.
% 0.59/1.01 % SZS output end CNFRefutation
% 0.59/1.01 #END OF PROOF
% 0.59/1.01
% 0.59/1.01 Problem WALDMEISTER_16946_n023
% 0.59/1.01 CPs.gen 71
% 0.59/1.01 CPs.reexp 0
% 0.59/1.01 Select 19
% 0.59/1.01 R 17
% 0.59/1.01 E 2
% 0.59/1.01 vsize 6.7M
% 0.59/1.01 rss 3.8M
% 0.59/1.01 process.time 0.009s
% 0.59/1.01 wallclock.time 0.009s
% 0.59/1.01 status S
% 0.59/1.01
% 0.59/1.01
% 0.59/1.01 Waldmeister states: Goal proved.
% 0.59/1.01 % SZS status Unsatisfiable
% 0.59/1.01
% 0.59/1.01 Problem WALDMEISTER_16946_n023
% 0.59/1.01 CPs.gen 0
% 0.59/1.01 CPs.reexp 0
% 0.59/1.01 Select 0
% 0.59/1.01 R 0
% 0.59/1.01 E 0
% 0.59/1.01 vsize 6.0M
% 0.59/1.01 rss 3.3M
% 0.59/1.01 process.time 0.001s
% 0.59/1.01 wallclock.time 0.008s
% 0.59/1.01 status S
%------------------------------------------------------------------------------