TSTP Solution File: GRP168-2 by Waldmeister---710
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : GRP168-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : woody %s
% Computer : n011.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:04 EDT 2022
% Result : Unsatisfiable 0.71s 1.07s
% Output : CNFRefutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP168-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.13 % Command : woody %s
% 0.13/0.34 % Computer : n011.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 18:39:34 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.71/1.07 ********************************************************************************
% 0.71/1.07 * W A L D M E I S T E R \| \ / \|/ *
% 0.71/1.07 * |/ | \/ | *
% 0.71/1.07 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.71/1.07 * A. Jaeger and B. Loechner | | *
% 0.71/1.07 * <waldmeister@informatik.uni-kl.de> | *
% 0.71/1.07 ********************************************************************************
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 Goals:
% 0.71/1.07 ------
% 0.71/1.07
% 0.71/1.07 ( 1) multiply(inverse(c),multiply(a,c)) ?=? greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c)))
% 0.71/1.07
% 0.71/1.07 Detected structure: VerbandsgeordneteGruppe
% 0.71/1.07 ********************************************************************************
% 0.71/1.07 ****************************** COMPLETION - PROOF ******************************
% 0.71/1.07 ********************************************************************************
% 0.71/1.07
% 0.71/1.07 joined goal: 1 multiply(inverse(c),multiply(a,c)) ?= greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) to greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c)))
% 0.71/1.07 goal joined
% 0.71/1.07 % SZS status Unsatisfiable
% 0.71/1.07 #START OF PROOF
% 0.71/1.07 % SZS output start CNFRefutation
% 0.71/1.07 cnf('0.7.0.0',axiom,
% 0.71/1.07 ( multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)) ),
% 0.71/1.07 file('/tmp/WALDMEISTER_14804_n011')).
% 0.71/1.07 cnf('0.7.1.0',plain,
% 0.71/1.07 ( multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)) ),
% 0.71/1.07 inference(weigh,[status(thm)],['0.7.0.0']),
% 0.71/1.07 [weight('<6,0,0,[0,0,0,7]>')]).
% 0.71/1.07 cnf('0.7.2.0',plain,
% 0.71/1.07 ( multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)) ),
% 0.71/1.07 inference(orient,[status(thm)],['0.7.1.0',theory(equality)]),
% 0.71/1.07 [u,rule_7]).
% 0.71/1.07 cnf('0.9.0.0',axiom,
% 0.71/1.07 ( multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.71/1.07 file('/tmp/WALDMEISTER_14804_n011')).
% 0.71/1.07 cnf('0.9.1.0',plain,
% 0.71/1.07 ( multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.71/1.07 inference(weigh,[status(thm)],['0.9.0.0']),
% 0.71/1.07 [weight('<8,0,0,[0,0,0,9]>')]).
% 0.71/1.07 cnf('0.9.2.0',plain,
% 0.71/1.07 ( multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.71/1.07 inference(orient,[status(thm)],['0.9.1.0',theory(equality)]),
% 0.71/1.07 [u,rule_9]).
% 0.71/1.07 cnf('0.12.0.0',axiom,
% 0.71/1.07 ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.71/1.07 file('/tmp/WALDMEISTER_14804_n011')).
% 0.71/1.07 cnf('0.12.1.0',plain,
% 0.71/1.07 ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.71/1.07 inference(weigh,[status(thm)],['0.12.0.0']),
% 0.71/1.07 [weight('<11,0,0,[0,0,0,12]>')]).
% 0.71/1.07 cnf('0.12.2.0',plain,
% 0.71/1.07 ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.71/1.07 inference(activate,[status(thm)],['0.12.1.0']),
% 0.71/1.07 [equation_1]).
% 0.71/1.07 cnf('0.14.0.0',axiom,
% 0.71/1.07 ( greatest_lower_bound(a,b) = a ),
% 0.71/1.07 file('/tmp/WALDMEISTER_14804_n011')).
% 0.71/1.07 cnf('0.14.1.0',plain,
% 0.71/1.07 ( greatest_lower_bound(a,b) = a ),
% 0.71/1.07 inference(weigh,[status(thm)],['0.14.0.0']),
% 0.71/1.07 [weight('<13,0,0,[0,0,0,14]>')]).
% 0.71/1.07 cnf('0.14.1.1',plain,
% 0.71/1.07 ( greatest_lower_bound(b,a) = a ),
% 0.71/1.07 inference(reduction,[status(thm)],['0.14.1.0','0.12.2.0',theory(equality)]),
% 0.71/1.07 [pos('L','L')]).
% 0.71/1.07 cnf('0.14.2.0',plain,
% 0.71/1.07 ( greatest_lower_bound(b,a) = a ),
% 0.71/1.07 inference(orient,[status(thm)],['0.14.1.1',theory(equality)]),
% 0.71/1.07 [u,rule_13]).
% 0.71/1.07 cnf('1.0.0.0',conjecture,
% 0.71/1.07 ( multiply(inverse(c),multiply(a,c)) = greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) ),
% 0.71/1.07 file('/tmp/WALDMEISTER_14804_n011',conjecture_1)).
% 0.71/1.07 cnf('1.0.0.1',plain,
% 0.71/1.07 ( multiply(inverse(c),multiply(greatest_lower_bound(b,a),c)) = greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) ),
% 0.71/1.07 inference(reduction,[status(thm)],['1.0.0.0','0.14.2.0',theory(equality)]),
% 0.71/1.07 [pos('L.2.1','R')]).
% 0.71/1.07 cnf('1.0.0.2',plain,
% 0.71/1.07 ( multiply(inverse(c),multiply(greatest_lower_bound(a,b),c)) = greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) ),
% 0.71/1.07 inference(reduction,[status(thm)],['1.0.0.1','0.12.2.0',theory(equality)]),
% 0.71/1.07 [pos('L.2.1','L')]).
% 0.71/1.07 cnf('1.0.0.3',plain,
% 0.71/1.07 ( multiply(inverse(c),greatest_lower_bound(multiply(a,c),multiply(b,c))) = greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) ),
% 0.71/1.07 inference(reduction,[status(thm)],['1.0.0.2','0.9.2.0',theory(equality)]),
% 0.71/1.07 [pos('L.2','L')]).
% 0.71/1.07 cnf('1.0.0.4',plain,
% 0.71/1.07 ( greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) = greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) ),
% 0.71/1.07 inference(reduction,[status(thm)],['1.0.0.3','0.7.2.0',theory(equality)]),
% 0.71/1.07 [pos('L','L')]).
% 0.71/1.07 cnf('1.0.0.5',plain,
% 0.71/1.07 ( $true ),
% 0.71/1.07 inference(trivial,[status(thm)],['1.0.0.4',theory(equality)]),
% 0.71/1.07 [conjecture_1]).
% 0.71/1.07
% 0.71/1.07 Proved Goals:
% 0.71/1.07 No. 1: multiply(inverse(c),multiply(a,c)) ?= greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) joined, current: greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) = greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c)))
% 0.71/1.07 1 goal was specified, which was proved.
% 0.71/1.07 % SZS output end CNFRefutation
% 0.71/1.07 #END OF PROOF
% 0.71/1.07
% 0.71/1.07 Problem WALDMEISTER_14804_n011
% 0.71/1.07 CPs.gen 44
% 0.71/1.07 CPs.reexp 0
% 0.71/1.07 Select 14
% 0.71/1.07 R 13
% 0.71/1.07 E 1
% 0.71/1.07 vsize 6.4M
% 0.71/1.07 rss 3.7M
% 0.71/1.07 process.time 0.002s
% 0.71/1.07 wallclock.time 0.003s
% 0.71/1.07 status S
% 0.71/1.07
% 0.71/1.07
% 0.71/1.07 Waldmeister states: Goal proved.
% 0.71/1.07 % SZS status Unsatisfiable
% 0.71/1.07
% 0.71/1.07 Problem WALDMEISTER_14804_n011
% 0.71/1.07 CPs.gen 0
% 0.71/1.07 CPs.reexp 0
% 0.71/1.07 Select 0
% 0.71/1.07 R 0
% 0.71/1.07 E 0
% 0.71/1.07 vsize 6.0M
% 0.71/1.07 rss 3.3M
% 0.71/1.07 process.time 0.001s
% 0.71/1.07 wallclock.time 0.002s
% 0.71/1.07 status S
%------------------------------------------------------------------------------