TSTP Solution File: GRP150-1 by Waldmeister---710
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : GRP150-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : woody %s
% Computer : n020.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.61s 1.02s
% Output : CNFRefutation 0.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP150-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.12 % Command : woody %s
% 0.12/0.33 % Computer : n020.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 : Tue Jun 14 06:09:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.61/1.02 ********************************************************************************
% 0.61/1.02 * W A L D M E I S T E R \| \ / \|/ *
% 0.61/1.02 * |/ | \/ | *
% 0.61/1.02 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.61/1.02 * A. Jaeger and B. Loechner | | *
% 0.61/1.02 * <waldmeister@informatik.uni-kl.de> | *
% 0.61/1.02 ********************************************************************************
% 0.61/1.02
% 0.61/1.02
% 0.61/1.02 Goals:
% 0.61/1.02 ------
% 0.61/1.02
% 0.61/1.02 ( 1) least_upper_bound(a,least_upper_bound(a,b)) ?=? least_upper_bound(a,b)
% 0.61/1.02
% 0.61/1.02 Detected structure: VerbandsgeordneteGruppe
% 0.61/1.02 ********************************************************************************
% 0.61/1.02 ****************************** COMPLETION - PROOF ******************************
% 0.61/1.02 ********************************************************************************
% 0.61/1.02
% 0.61/1.02 joined goal: 1 least_upper_bound(a,least_upper_bound(a,b)) ?= least_upper_bound(a,b) to least_upper_bound(b,a)
% 0.61/1.02 goal joined
% 0.61/1.02 % SZS status Unsatisfiable
% 0.61/1.02 #START OF PROOF
% 0.61/1.02 % SZS output start CNFRefutation
% 0.61/1.02 cnf('0.4.0.0',axiom,
% 0.61/1.02 ( X1 = least_upper_bound(X1,X1) ),
% 0.61/1.02 file('/tmp/WALDMEISTER_16152_n020')).
% 0.61/1.02 cnf('0.4.1.0',plain,
% 0.61/1.02 ( X1 = least_upper_bound(X1,X1) ),
% 0.61/1.02 inference(weigh,[status(thm)],['0.4.0.0']),
% 0.61/1.02 [weight('<3,0,0,[0,0,0,4]>')]).
% 0.61/1.02 cnf('0.4.2.0',plain,
% 0.61/1.02 ( least_upper_bound(X1,X1) = X1 ),
% 0.61/1.02 inference(orient,[status(thm)],['0.4.1.0',theory(equality)]),
% 0.61/1.02 [x,rule_4]).
% 0.61/1.02 cnf('0.14.0.0',axiom,
% 0.61/1.02 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.61/1.02 file('/tmp/WALDMEISTER_16152_n020')).
% 0.61/1.02 cnf('0.14.1.0',plain,
% 0.61/1.02 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.61/1.02 inference(weigh,[status(thm)],['0.14.0.0']),
% 0.61/1.02 [weight('<13,0,0,[0,0,0,14]>')]).
% 0.61/1.02 cnf('0.14.2.0',plain,
% 0.61/1.02 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.61/1.02 inference(activate,[status(thm)],['0.14.1.0']),
% 0.61/1.02 [equation_2]).
% 0.61/1.02 cnf('0.15.0.0',axiom,
% 0.61/1.02 ( least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3) ),
% 0.61/1.02 file('/tmp/WALDMEISTER_16152_n020')).
% 0.61/1.02 cnf('0.15.1.0',plain,
% 0.61/1.02 ( least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3) ),
% 0.61/1.02 inference(weigh,[status(thm)],['0.15.0.0']),
% 0.61/1.02 [weight('<14,0,0,[0,0,0,15]>')]).
% 0.61/1.02 cnf('0.15.2.0',plain,
% 0.61/1.02 ( least_upper_bound(least_upper_bound(X1,X2),X3) = least_upper_bound(X1,least_upper_bound(X2,X3)) ),
% 0.61/1.02 inference(orient,[status(thm)],['0.15.1.0',theory(equality)]),
% 0.61/1.02 [x,rule_13]).
% 0.61/1.02 cnf('1.0.0.0',conjecture,
% 0.61/1.02 ( least_upper_bound(a,least_upper_bound(a,b)) = least_upper_bound(a,b) ),
% 0.61/1.02 file('/tmp/WALDMEISTER_16152_n020',conjecture_1)).
% 0.61/1.02 cnf('1.0.0.1',plain,
% 0.61/1.02 ( least_upper_bound(a,least_upper_bound(b,a)) = least_upper_bound(a,b) ),
% 0.61/1.02 inference(reduction,[status(thm)],['1.0.0.0','0.14.2.0',theory(equality)]),
% 0.61/1.02 [pos('L.2','L')]).
% 0.61/1.02 cnf('1.0.0.2',plain,
% 0.61/1.02 ( least_upper_bound(a,least_upper_bound(b,a)) = least_upper_bound(b,a) ),
% 0.61/1.02 inference(reduction,[status(thm)],['1.0.0.1','0.14.2.0',theory(equality)]),
% 0.61/1.02 [pos('R','L')]).
% 0.61/1.02 cnf('1.0.0.3',plain,
% 0.61/1.02 ( least_upper_bound(least_upper_bound(b,a),a) = least_upper_bound(b,a) ),
% 0.61/1.02 inference(reduction,[status(thm)],['1.0.0.2','0.14.2.0',theory(equality)]),
% 0.61/1.02 [pos('L','L')]).
% 0.61/1.02 cnf('1.0.0.4',plain,
% 0.61/1.02 ( least_upper_bound(b,least_upper_bound(a,a)) = least_upper_bound(b,a) ),
% 0.61/1.02 inference(reduction,[status(thm)],['1.0.0.3','0.15.2.0',theory(equality)]),
% 0.61/1.02 [pos('L','L')]).
% 0.61/1.02 cnf('1.0.0.5',plain,
% 0.61/1.02 ( least_upper_bound(b,a) = least_upper_bound(b,a) ),
% 0.61/1.02 inference(reduction,[status(thm)],['1.0.0.4','0.4.2.0',theory(equality)]),
% 0.61/1.02 [pos('L.2','L')]).
% 0.61/1.02 cnf('1.0.0.6',plain,
% 0.61/1.02 ( $true ),
% 0.61/1.02 inference(trivial,[status(thm)],['1.0.0.5',theory(equality)]),
% 0.61/1.02 [conjecture_1]).
% 0.61/1.02
% 0.61/1.02 Proved Goals:
% 0.61/1.02 No. 1: least_upper_bound(a,least_upper_bound(a,b)) ?= least_upper_bound(a,b) joined, current: least_upper_bound(b,a) = least_upper_bound(b,a)
% 0.61/1.02 1 goal was specified, which was proved.
% 0.61/1.02 % SZS output end CNFRefutation
% 0.61/1.02 #END OF PROOF
% 0.61/1.02
% 0.61/1.02 Problem WALDMEISTER_16152_n020
% 0.61/1.02 CPs.gen 49
% 0.61/1.02 CPs.reexp 0
% 0.61/1.02 Select 15
% 0.61/1.02 R 13
% 0.61/1.02 E 2
% 0.61/1.02 vsize 6.5M
% 0.61/1.02 rss 3.7M
% 0.61/1.02 process.time 0.002s
% 0.61/1.02 wallclock.time 0.003s
% 0.61/1.02 status S
% 0.61/1.02
% 0.61/1.02
% 0.61/1.02 Waldmeister states: Goal proved.
% 0.61/1.02 % SZS status Unsatisfiable
% 0.61/1.02
% 0.61/1.02 Problem WALDMEISTER_16152_n020
% 0.61/1.02 CPs.gen 0
% 0.61/1.02 CPs.reexp 0
% 0.61/1.02 Select 0
% 0.61/1.02 R 0
% 0.61/1.02 E 0
% 0.61/1.02 vsize 6.0M
% 0.61/1.02 rss 3.2M
% 0.61/1.02 process.time 0.001s
% 0.61/1.02 wallclock.time 0.002s
% 0.61/1.02 status S
%------------------------------------------------------------------------------