TSTP Solution File: GRP148-1 by Waldmeister---710
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : GRP148-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : woody %s
% Computer : n021.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.56s 0.97s
% Output : CNFRefutation 0.56s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP148-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.12 % Command : woody %s
% 0.12/0.33 % Computer : n021.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 05:51:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.56/0.97 ********************************************************************************
% 0.56/0.97 * W A L D M E I S T E R \| \ / \|/ *
% 0.56/0.97 * |/ | \/ | *
% 0.56/0.97 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.56/0.97 * A. Jaeger and B. Loechner | | *
% 0.56/0.97 * <waldmeister@informatik.uni-kl.de> | *
% 0.56/0.97 ********************************************************************************
% 0.56/0.97
% 0.56/0.97
% 0.56/0.97 Goals:
% 0.56/0.97 ------
% 0.56/0.97
% 0.56/0.97 ( 1) least_upper_bound(a,b) ?=? greatest_lower_bound(least_upper_bound(a,b),c)
% 0.56/0.97
% 0.56/0.97 Detected structure: VerbandsgeordneteGruppe
% 0.56/0.97 ********************************************************************************
% 0.56/0.97 ****************************** COMPLETION - PROOF ******************************
% 0.56/0.97 ********************************************************************************
% 0.56/0.97
% 0.56/0.97 joined goal: 1 least_upper_bound(a,b) ?= greatest_lower_bound(least_upper_bound(a,b),c) to least_upper_bound(a,b)
% 0.56/0.97 goal joined
% 0.56/0.97 % SZS status Unsatisfiable
% 0.56/0.97 #START OF PROOF
% 0.56/0.97 % SZS output start CNFRefutation
% 0.56/0.97 cnf('0.5.0.0',axiom,
% 0.56/0.97 ( X1 = greatest_lower_bound(X1,least_upper_bound(X1,X2)) ),
% 0.56/0.97 file('/tmp/WALDMEISTER_28378_n021')).
% 0.56/0.97 cnf('0.5.1.0',plain,
% 0.56/0.97 ( X1 = greatest_lower_bound(X1,least_upper_bound(X1,X2)) ),
% 0.56/0.97 inference(weigh,[status(thm)],['0.5.0.0']),
% 0.56/0.97 [weight('<4,0,0,[0,0,0,5]>')]).
% 0.56/0.97 cnf('0.5.2.0',plain,
% 0.56/0.97 ( greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1 ),
% 0.56/0.97 inference(orient,[status(thm)],['0.5.1.0',theory(equality)]),
% 0.56/0.97 [x,rule_5]).
% 0.56/0.97 cnf('0.12.0.0',axiom,
% 0.56/0.97 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.56/0.97 file('/tmp/WALDMEISTER_28378_n021')).
% 0.56/0.97 cnf('0.12.1.0',plain,
% 0.56/0.97 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.56/0.97 inference(weigh,[status(thm)],['0.12.0.0']),
% 0.56/0.97 [weight('<11,0,0,[0,0,0,12]>')]).
% 0.56/0.97 cnf('0.12.2.0',plain,
% 0.56/0.97 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.56/0.97 inference(activate,[status(thm)],['0.12.1.0']),
% 0.56/0.97 [equation_1]).
% 0.56/0.97 cnf('0.13.0.0',axiom,
% 0.56/0.97 ( least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3) ),
% 0.56/0.97 file('/tmp/WALDMEISTER_28378_n021')).
% 0.56/0.97 cnf('0.13.1.0',plain,
% 0.56/0.97 ( least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3) ),
% 0.56/0.97 inference(weigh,[status(thm)],['0.13.0.0']),
% 0.56/0.97 [weight('<12,0,0,[0,0,0,13]>')]).
% 0.56/0.97 cnf('0.13.2.0',plain,
% 0.56/0.97 ( least_upper_bound(least_upper_bound(X1,X2),X3) = least_upper_bound(X1,least_upper_bound(X2,X3)) ),
% 0.56/0.97 inference(orient,[status(thm)],['0.13.1.0',theory(equality)]),
% 0.56/0.97 [x,rule_12]).
% 0.56/0.97 cnf('0.14.0.0',axiom,
% 0.56/0.97 ( least_upper_bound(a,c) = c ),
% 0.56/0.97 file('/tmp/WALDMEISTER_28378_n021')).
% 0.56/0.97 cnf('0.14.1.0',plain,
% 0.56/0.97 ( least_upper_bound(a,c) = c ),
% 0.56/0.97 inference(weigh,[status(thm)],['0.14.0.0']),
% 0.56/0.97 [weight('<13,0,0,[0,0,0,14]>')]).
% 0.56/0.97 cnf('0.14.2.0',plain,
% 0.56/0.97 ( least_upper_bound(a,c) = c ),
% 0.56/0.97 inference(orient,[status(thm)],['0.14.1.0',theory(equality)]),
% 0.56/0.97 [u,rule_13]).
% 0.56/0.97 cnf('0.15.0.0',axiom,
% 0.56/0.97 ( least_upper_bound(b,c) = c ),
% 0.56/0.97 file('/tmp/WALDMEISTER_28378_n021')).
% 0.56/0.97 cnf('0.15.1.0',plain,
% 0.56/0.97 ( least_upper_bound(b,c) = c ),
% 0.56/0.97 inference(weigh,[status(thm)],['0.15.0.0']),
% 0.56/0.97 [weight('<14,0,0,[0,0,0,15]>')]).
% 0.56/0.97 cnf('0.15.2.0',plain,
% 0.56/0.97 ( least_upper_bound(b,c) = c ),
% 0.56/0.97 inference(orient,[status(thm)],['0.15.1.0',theory(equality)]),
% 0.56/0.97 [u,rule_14]).
% 0.56/0.97 cnf('1.0.0.0',conjecture,
% 0.56/0.97 ( least_upper_bound(a,b) = greatest_lower_bound(least_upper_bound(a,b),c) ),
% 0.56/0.97 file('/tmp/WALDMEISTER_28378_n021',conjecture_1)).
% 0.56/0.97 cnf('1.0.0.1',plain,
% 0.56/0.97 ( least_upper_bound(a,b) = greatest_lower_bound(least_upper_bound(a,b),least_upper_bound(a,c)) ),
% 0.56/0.97 inference(reduction,[status(thm)],['1.0.0.0','0.14.2.0',theory(equality)]),
% 0.56/0.97 [pos('R.2','R')]).
% 0.56/0.97 cnf('1.0.0.2',plain,
% 0.56/0.97 ( least_upper_bound(a,b) = greatest_lower_bound(least_upper_bound(a,b),least_upper_bound(c,a)) ),
% 0.56/0.97 inference(reduction,[status(thm)],['1.0.0.1','0.12.2.0',theory(equality)]),
% 0.56/0.97 [pos('R.2','L')]).
% 0.56/0.97 cnf('1.0.0.3',plain,
% 0.56/0.97 ( least_upper_bound(a,b) = greatest_lower_bound(least_upper_bound(a,b),least_upper_bound(least_upper_bound(b,c),a)) ),
% 0.56/0.97 inference(reduction,[status(thm)],['1.0.0.2','0.15.2.0',theory(equality)]),
% 0.56/0.97 [pos('R.2.1','R')]).
% 0.56/0.97 cnf('1.0.0.4',plain,
% 0.56/0.97 ( least_upper_bound(a,b) = greatest_lower_bound(least_upper_bound(a,b),least_upper_bound(least_upper_bound(c,b),a)) ),
% 0.56/0.97 inference(reduction,[status(thm)],['1.0.0.3','0.12.2.0',theory(equality)]),
% 0.56/0.97 [pos('R.2.1','L')]).
% 0.56/0.97 cnf('1.0.0.5',plain,
% 0.56/0.97 ( least_upper_bound(a,b) = greatest_lower_bound(least_upper_bound(b,a),least_upper_bound(least_upper_bound(c,b),a)) ),
% 0.56/0.97 inference(reduction,[status(thm)],['1.0.0.4','0.12.2.0',theory(equality)]),
% 0.56/0.97 [pos('R.1','L')]).
% 0.56/0.97 cnf('1.0.0.6',plain,
% 0.56/0.97 ( least_upper_bound(a,b) = greatest_lower_bound(least_upper_bound(b,a),least_upper_bound(c,least_upper_bound(b,a))) ),
% 0.56/0.97 inference(reduction,[status(thm)],['1.0.0.5','0.13.2.0',theory(equality)]),
% 0.56/0.97 [pos('R.2','L')]).
% 0.56/0.97 cnf('1.0.0.7',plain,
% 0.56/0.97 ( least_upper_bound(a,b) = greatest_lower_bound(least_upper_bound(b,a),least_upper_bound(c,least_upper_bound(a,b))) ),
% 0.56/0.97 inference(reduction,[status(thm)],['1.0.0.6','0.12.2.0',theory(equality)]),
% 0.56/0.97 [pos('R.2.2','L')]).
% 0.56/0.97 cnf('1.0.0.8',plain,
% 0.56/0.97 ( least_upper_bound(a,b) = greatest_lower_bound(least_upper_bound(b,a),least_upper_bound(least_upper_bound(a,b),c)) ),
% 0.56/0.97 inference(reduction,[status(thm)],['1.0.0.7','0.12.2.0',theory(equality)]),
% 0.56/0.97 [pos('R.2','L')]).
% 0.56/0.97 cnf('1.0.0.9',plain,
% 0.56/0.97 ( least_upper_bound(a,b) = greatest_lower_bound(least_upper_bound(a,b),least_upper_bound(least_upper_bound(a,b),c)) ),
% 0.56/0.97 inference(reduction,[status(thm)],['1.0.0.8','0.12.2.0',theory(equality)]),
% 0.56/0.97 [pos('R.1','L')]).
% 0.56/0.97 cnf('1.0.0.10',plain,
% 0.56/0.97 ( least_upper_bound(a,b) = least_upper_bound(a,b) ),
% 0.56/0.97 inference(reduction,[status(thm)],['1.0.0.9','0.5.2.0',theory(equality)]),
% 0.56/0.97 [pos('R','L')]).
% 0.56/0.97 cnf('1.0.0.11',plain,
% 0.56/0.97 ( $true ),
% 0.56/0.97 inference(trivial,[status(thm)],['1.0.0.10',theory(equality)]),
% 0.56/0.97 [conjecture_1]).
% 0.56/0.97
% 0.56/0.97 Proved Goals:
% 0.56/0.97 No. 1: least_upper_bound(a,b) ?= greatest_lower_bound(least_upper_bound(a,b),c) joined, current: least_upper_bound(a,b) = least_upper_bound(a,b)
% 0.56/0.97 1 goal was specified, which was proved.
% 0.56/0.97 % SZS output end CNFRefutation
% 0.56/0.97 #END OF PROOF
% 0.56/0.97
% 0.56/0.97 Problem WALDMEISTER_28378_n021
% 0.56/0.97 CPs.gen 48
% 0.56/0.97 CPs.reexp 0
% 0.56/0.97 Select 15
% 0.56/0.97 R 14
% 0.56/0.97 E 1
% 0.56/0.97 vsize 6.4M
% 0.56/0.97 rss 3.7M
% 0.56/0.97 process.time 0.002s
% 0.56/0.97 wallclock.time 0.003s
% 0.56/0.97 status S
% 0.56/0.97
% 0.56/0.97
% 0.56/0.97 Waldmeister states: Goal proved.
% 0.56/0.97 % SZS status Unsatisfiable
% 0.56/0.97
% 0.56/0.97 Problem WALDMEISTER_28378_n021
% 0.56/0.97 CPs.gen 0
% 0.56/0.97 CPs.reexp 0
% 0.56/0.97 Select 0
% 0.56/0.97 R 0
% 0.56/0.97 E 0
% 0.56/0.97 vsize 6.0M
% 0.56/0.97 rss 3.3M
% 0.56/0.97 process.time 0.001s
% 0.56/0.97 wallclock.time 0.002s
% 0.56/0.97 status S
%------------------------------------------------------------------------------