TSTP Solution File: GRP165-2 by Waldmeister---710
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : GRP165-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : woody %s
% Computer : n018.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:01 EDT 2022
% Result : Unsatisfiable 0.58s 0.98s
% Output : CNFRefutation 0.58s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : GRP165-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.08/0.13 % Command : woody %s
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 05:05:58 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.58/0.98 ********************************************************************************
% 0.58/0.98 * W A L D M E I S T E R \| \ / \|/ *
% 0.58/0.98 * |/ | \/ | *
% 0.58/0.98 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.58/0.98 * A. Jaeger and B. Loechner | | *
% 0.58/0.98 * <waldmeister@informatik.uni-kl.de> | *
% 0.58/0.98 ********************************************************************************
% 0.58/0.98
% 0.58/0.98
% 0.58/0.98 Goals:
% 0.58/0.98 ------
% 0.58/0.98
% 0.58/0.98 ( 1) greatest_lower_bound(a,multiply(a,a)) ?=? a
% 0.58/0.98
% 0.58/0.98 Detected structure: VerbandsgeordneteGruppe
% 0.58/0.98 ********************************************************************************
% 0.58/0.98 ****************************** COMPLETION - PROOF ******************************
% 0.58/0.98 ********************************************************************************
% 0.58/0.98
% 0.58/0.98 joined goal: 1 greatest_lower_bound(a,multiply(a,a)) ?= a to a
% 0.58/0.98 goal joined
% 0.58/0.98 % SZS status Unsatisfiable
% 0.58/0.98 #START OF PROOF
% 0.58/0.98 % SZS output start CNFRefutation
% 0.58/0.98 cnf('0.1.0.0',axiom,
% 0.58/0.98 ( X1 = multiply(identity,X1) ),
% 0.58/0.98 file('/tmp/WALDMEISTER_14017_n018')).
% 0.58/0.98 cnf('0.1.1.0',plain,
% 0.58/0.98 ( X1 = multiply(identity,X1) ),
% 0.58/0.98 inference(weigh,[status(thm)],['0.1.0.0']),
% 0.58/0.98 [weight('<0,0,0,[0,0,0,1]>')]).
% 0.58/0.98 cnf('0.1.2.0',plain,
% 0.58/0.98 ( multiply(identity,X1) = X1 ),
% 0.58/0.98 inference(orient,[status(thm)],['0.1.1.0',theory(equality)]),
% 0.58/0.98 [x,rule_1]).
% 0.58/0.98 cnf('0.3.0.0',axiom,
% 0.58/0.98 ( X1 = greatest_lower_bound(X1,least_upper_bound(X1,X2)) ),
% 0.58/0.98 file('/tmp/WALDMEISTER_14017_n018')).
% 0.58/0.98 cnf('0.3.1.0',plain,
% 0.58/0.98 ( X1 = greatest_lower_bound(X1,least_upper_bound(X1,X2)) ),
% 0.58/0.98 inference(weigh,[status(thm)],['0.3.0.0']),
% 0.58/0.98 [weight('<2,0,0,[0,0,0,3]>')]).
% 0.58/0.98 cnf('0.3.2.0',plain,
% 0.58/0.98 ( greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1 ),
% 0.58/0.98 inference(orient,[status(thm)],['0.3.1.0',theory(equality)]),
% 0.58/0.98 [x,rule_3]).
% 0.58/0.98 cnf('0.5.0.0',axiom,
% 0.58/0.98 ( X1 = least_upper_bound(X1,greatest_lower_bound(X1,X2)) ),
% 0.58/0.98 file('/tmp/WALDMEISTER_14017_n018')).
% 0.58/0.98 cnf('0.5.1.0',plain,
% 0.58/0.98 ( X1 = least_upper_bound(X1,greatest_lower_bound(X1,X2)) ),
% 0.58/0.98 inference(weigh,[status(thm)],['0.5.0.0']),
% 0.58/0.98 [weight('<4,0,0,[0,0,0,5]>')]).
% 0.58/0.98 cnf('0.5.2.0',plain,
% 0.58/0.98 ( least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1 ),
% 0.58/0.98 inference(orient,[status(thm)],['0.5.1.0',theory(equality)]),
% 0.58/0.98 [x,rule_5]).
% 0.58/0.98 cnf('0.10.0.0',axiom,
% 0.58/0.98 ( multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.58/0.98 file('/tmp/WALDMEISTER_14017_n018')).
% 0.58/0.98 cnf('0.10.1.0',plain,
% 0.58/0.98 ( multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.58/0.98 inference(weigh,[status(thm)],['0.10.0.0']),
% 0.58/0.98 [weight('<9,0,0,[0,0,0,10]>')]).
% 0.58/0.98 cnf('0.10.2.0',plain,
% 0.58/0.98 ( multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.58/0.98 inference(orient,[status(thm)],['0.10.1.0',theory(equality)]),
% 0.58/0.98 [u,rule_10]).
% 0.58/0.98 cnf('0.12.0.0',axiom,
% 0.58/0.98 ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.58/0.98 file('/tmp/WALDMEISTER_14017_n018')).
% 0.58/0.98 cnf('0.12.1.0',plain,
% 0.58/0.98 ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.58/0.98 inference(weigh,[status(thm)],['0.12.0.0']),
% 0.58/0.98 [weight('<11,0,0,[0,0,0,12]>')]).
% 0.58/0.98 cnf('0.12.2.0',plain,
% 0.58/0.98 ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.58/0.98 inference(activate,[status(thm)],['0.12.1.0']),
% 0.58/0.98 [equation_1]).
% 0.58/0.98 cnf('0.14.0.0',axiom,
% 0.58/0.98 ( greatest_lower_bound(a,identity) = identity ),
% 0.58/0.98 file('/tmp/WALDMEISTER_14017_n018')).
% 0.58/0.98 cnf('0.14.1.0',plain,
% 0.58/0.98 ( greatest_lower_bound(a,identity) = identity ),
% 0.58/0.98 inference(weigh,[status(thm)],['0.14.0.0']),
% 0.58/0.98 [weight('<13,0,0,[0,0,0,14]>')]).
% 0.58/0.98 cnf('0.14.2.0',plain,
% 0.58/0.98 ( greatest_lower_bound(a,identity) = identity ),
% 0.58/0.98 inference(orient,[status(thm)],['0.14.1.0',theory(equality)]),
% 0.58/0.98 [u,rule_13]).
% 0.58/0.98 cnf('0.15.0.0',axiom,
% 0.58/0.98 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.58/0.98 file('/tmp/WALDMEISTER_14017_n018')).
% 0.58/0.98 cnf('0.15.1.0',plain,
% 0.58/0.98 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.58/0.98 inference(weigh,[status(thm)],['0.15.0.0']),
% 0.58/0.98 [weight('<14,0,0,[0,0,0,15]>')]).
% 0.58/0.98 cnf('0.15.2.0',plain,
% 0.58/0.98 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.58/0.98 inference(activate,[status(thm)],['0.15.1.0']),
% 0.58/0.98 [equation_2]).
% 0.58/0.98 cnf('0.17.0.0',plain,
% 0.58/0.98 ( a = least_upper_bound(a,identity) ),
% 0.58/0.98 inference(cp,[status(thm)],['0.5.2.0','0.14.2.0',theory(equality)]),
% 0.58/0.98 [pos('L.2','L')]).
% 0.58/0.98 cnf('0.17.1.0',plain,
% 0.58/0.98 ( a = least_upper_bound(a,identity) ),
% 0.58/0.98 inference(weigh,[status(thm)],['0.17.0.0']),
% 0.58/0.98 [weight('<19,14,5,[0,0,0,2]>')]).
% 0.58/0.98 cnf('0.17.2.0',plain,
% 0.58/0.98 ( least_upper_bound(a,identity) = a ),
% 0.58/0.98 inference(orient,[status(thm)],['0.17.1.0',theory(equality)]),
% 0.58/0.98 [x,rule_15]).
% 0.58/0.98 cnf('1.0.0.0',conjecture,
% 0.58/0.98 ( greatest_lower_bound(a,multiply(a,a)) = a ),
% 0.58/0.98 file('/tmp/WALDMEISTER_14017_n018',conjecture_1)).
% 0.58/0.98 cnf('1.0.0.1',plain,
% 0.58/0.98 ( greatest_lower_bound(multiply(a,a),a) = a ),
% 0.58/0.98 inference(reduction,[status(thm)],['1.0.0.0','0.12.2.0',theory(equality)]),
% 0.58/0.98 [pos('L','L')]).
% 0.58/0.98 cnf('1.0.0.2',plain,
% 0.58/0.98 ( greatest_lower_bound(multiply(least_upper_bound(a,identity),a),a) = a ),
% 0.58/0.98 inference(reduction,[status(thm)],['1.0.0.1','0.17.2.0',theory(equality)]),
% 0.58/0.98 [pos('L.1.1','R')]).
% 0.58/0.98 cnf('1.0.0.3',plain,
% 0.58/0.98 ( greatest_lower_bound(multiply(least_upper_bound(identity,a),a),a) = a ),
% 0.58/0.98 inference(reduction,[status(thm)],['1.0.0.2','0.15.2.0',theory(equality)]),
% 0.58/0.98 [pos('L.1.1','L')]).
% 0.58/0.98 cnf('1.0.0.4',plain,
% 0.58/0.98 ( greatest_lower_bound(a,multiply(least_upper_bound(identity,a),a)) = a ),
% 0.58/0.98 inference(reduction,[status(thm)],['1.0.0.3','0.12.2.0',theory(equality)]),
% 0.58/0.98 [pos('L','L')]).
% 0.58/0.98 cnf('1.0.0.5',plain,
% 0.58/0.98 ( greatest_lower_bound(a,least_upper_bound(multiply(identity,a),multiply(a,a))) = a ),
% 0.58/0.98 inference(reduction,[status(thm)],['1.0.0.4','0.10.2.0',theory(equality)]),
% 0.58/0.98 [pos('L.2','L')]).
% 0.58/0.98 cnf('1.0.0.6',plain,
% 0.58/0.98 ( greatest_lower_bound(a,least_upper_bound(a,multiply(a,a))) = a ),
% 0.58/0.98 inference(reduction,[status(thm)],['1.0.0.5','0.1.2.0',theory(equality)]),
% 0.58/0.98 [pos('L.2.1','L')]).
% 0.58/0.98 cnf('1.0.0.7',plain,
% 0.58/0.98 ( a = a ),
% 0.58/0.98 inference(reduction,[status(thm)],['1.0.0.6','0.3.2.0',theory(equality)]),
% 0.58/0.98 [pos('L','L')]).
% 0.58/0.98 cnf('1.0.0.8',plain,
% 0.58/0.98 ( $true ),
% 0.58/0.98 inference(trivial,[status(thm)],['1.0.0.7',theory(equality)]),
% 0.58/0.98 [conjecture_1]).
% 0.58/0.98
% 0.58/0.98 Proved Goals:
% 0.58/0.98 No. 1: greatest_lower_bound(a,multiply(a,a)) ?= a joined, current: a = a
% 0.58/0.98 1 goal was specified, which was proved.
% 0.58/0.98 % SZS output end CNFRefutation
% 0.58/0.98 #END OF PROOF
% 0.58/0.98
% 0.58/0.98 Problem WALDMEISTER_14017_n018
% 0.58/0.98 CPs.gen 63
% 0.58/0.98 CPs.reexp 0
% 0.58/0.98 Select 17
% 0.58/0.98 R 15
% 0.58/0.98 E 2
% 0.58/0.98 vsize 6.5M
% 0.58/0.98 rss 3.7M
% 0.58/0.98 process.time 0.002s
% 0.58/0.98 wallclock.time 0.003s
% 0.58/0.98 status S
% 0.58/0.98
% 0.58/0.98
% 0.58/0.98 Waldmeister states: Goal proved.
% 0.58/0.98 % SZS status Unsatisfiable
% 0.58/0.98
% 0.58/0.98 Problem WALDMEISTER_14017_n018
% 0.58/0.98 CPs.gen 0
% 0.58/0.98 CPs.reexp 0
% 0.58/0.98 Select 0
% 0.58/0.98 R 0
% 0.58/0.98 E 0
% 0.58/0.98 vsize 6.0M
% 0.58/0.98 rss 3.2M
% 0.58/0.98 process.time 0.001s
% 0.58/0.98 wallclock.time 0.003s
% 0.58/0.98 status S
%------------------------------------------------------------------------------