TSTP Solution File: GRP679-1 by Waldmeister---710
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : GRP679-1 : TPTP v8.1.0. Released v4.0.0.
% 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:27:50 EDT 2022
% Result : Unsatisfiable 0.64s 1.04s
% Output : CNFRefutation 0.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP679-1 : TPTP v8.1.0. Released v4.0.0.
% 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 : Mon Jun 13 21:50:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.64/1.04 ********************************************************************************
% 0.64/1.04 * W A L D M E I S T E R \| \ / \|/ *
% 0.64/1.04 * |/ | \/ | *
% 0.64/1.04 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.64/1.04 * A. Jaeger and B. Loechner | | *
% 0.64/1.04 * <waldmeister@informatik.uni-kl.de> | *
% 0.64/1.04 ********************************************************************************
% 0.64/1.04
% 0.64/1.04
% 0.64/1.04 Goals:
% 0.64/1.04 ------
% 0.64/1.04
% 0.64/1.04 ( 1) mult(mult(op_c,op_c),a) ?=? mult(a,mult(op_c,op_c))
% 0.64/1.04
% 0.64/1.04 Detected structure: Loop
% 0.64/1.04 ********************************************************************************
% 0.64/1.04 ****************************** COMPLETION - PROOF ******************************
% 0.64/1.04 ********************************************************************************
% 0.64/1.04
% 0.64/1.04 joined goal: 1 mult(mult(op_c,op_c),a) ?= mult(a,mult(op_c,op_c)) to mult(op_c,mult(op_c,a))
% 0.64/1.04 goal joined
% 0.64/1.04 % SZS status Unsatisfiable
% 0.64/1.04 #START OF PROOF
% 0.64/1.04 % SZS output start CNFRefutation
% 0.64/1.04 cnf('0.3.0.0',axiom,
% 0.64/1.04 ( X1 = mult(unit,X1) ),
% 0.64/1.04 file('/tmp/WALDMEISTER_18293_n020')).
% 0.64/1.04 cnf('0.3.1.0',plain,
% 0.64/1.04 ( X1 = mult(unit,X1) ),
% 0.64/1.04 inference(weigh,[status(thm)],['0.3.0.0']),
% 0.64/1.04 [weight('<2,0,0,[0,0,0,3]>')]).
% 0.64/1.04 cnf('0.3.2.0',plain,
% 0.64/1.04 ( mult(unit,X1) = X1 ),
% 0.64/1.04 inference(orient,[status(thm)],['0.3.1.0',theory(equality)]),
% 0.64/1.04 [x,rule_3]).
% 0.64/1.04 cnf('0.7.0.0',axiom,
% 0.64/1.04 ( mult(X1,mult(X2,mult(X1,X3))) = mult(mult(X1,mult(X2,X1)),X3) ),
% 0.64/1.04 file('/tmp/WALDMEISTER_18293_n020')).
% 0.64/1.04 cnf('0.7.1.0',plain,
% 0.64/1.04 ( mult(X1,mult(X2,mult(X1,X3))) = mult(mult(X1,mult(X2,X1)),X3) ),
% 0.64/1.04 inference(weigh,[status(thm)],['0.7.0.0']),
% 0.64/1.04 [weight('<6,0,0,[0,0,0,7]>')]).
% 0.64/1.04 cnf('0.7.2.0',plain,
% 0.64/1.04 ( mult(mult(X1,mult(X2,X1)),X3) = mult(X1,mult(X2,mult(X1,X3))) ),
% 0.64/1.04 inference(orient,[status(thm)],['0.7.1.0',theory(equality)]),
% 0.64/1.04 [x,rule_7]).
% 0.64/1.04 cnf('0.8.0.0',axiom,
% 0.64/1.04 ( mult(X1,op_c) = mult(op_c,X1) ),
% 0.64/1.04 file('/tmp/WALDMEISTER_18293_n020')).
% 0.64/1.04 cnf('0.8.1.0',plain,
% 0.64/1.04 ( mult(X1,op_c) = mult(op_c,X1) ),
% 0.64/1.04 inference(weigh,[status(thm)],['0.8.0.0']),
% 0.64/1.04 [weight('<7,0,0,[0,0,0,8]>')]).
% 0.64/1.04 cnf('0.8.2.0',plain,
% 0.64/1.04 ( mult(X1,op_c) = mult(op_c,X1) ),
% 0.64/1.04 inference(activate,[status(thm)],['0.8.1.0']),
% 0.64/1.04 [equation_1]).
% 0.64/1.04 cnf('0.21.0.0',plain,
% 0.64/1.04 ( mult(X1,mult(unit,mult(X1,X2))) = mult(mult(X1,X1),X2) ),
% 0.64/1.04 inference(cp,[status(thm)],['0.7.2.0','0.3.2.0',theory(equality)]),
% 0.64/1.04 [pos('L.1.2','L')]).
% 0.64/1.04 cnf('0.21.0.1',plain,
% 0.64/1.04 ( mult(X1,mult(X1,X2)) = mult(mult(X1,X1),X2) ),
% 0.64/1.04 inference(reduction,[status(thm)],['0.21.0.0','0.3.2.0',theory(equality)]),
% 0.64/1.04 [pos('L.2','L')]).
% 0.64/1.04 cnf('0.21.1.0',plain,
% 0.64/1.04 ( mult(X1,mult(X1,X2)) = mult(mult(X1,X1),X2) ),
% 0.64/1.04 inference(weigh,[status(thm)],['0.21.0.1']),
% 0.64/1.04 [weight('<65,7,3,[1,0,0,3]>')]).
% 0.64/1.04 cnf('0.21.2.0',plain,
% 0.64/1.04 ( mult(mult(X1,X1),X2) = mult(X1,mult(X1,X2)) ),
% 0.64/1.04 inference(orient,[status(thm)],['0.21.1.0',theory(equality)]),
% 0.64/1.04 [x,rule_20]).
% 0.64/1.04 cnf('0.41.0.0',plain,
% 0.64/1.04 ( mult(op_c,mult(X1,mult(op_c,X2))) = mult(mult(op_c,mult(op_c,X1)),X2) ),
% 0.64/1.04 inference(cp,[status(thm)],['0.7.2.0','0.8.2.0',theory(equality)]),
% 0.64/1.04 [pos('L.1.2','L')]).
% 0.64/1.04 cnf('0.41.1.0',plain,
% 0.64/1.04 ( mult(op_c,mult(X1,mult(op_c,X2))) = mult(mult(op_c,mult(op_c,X1)),X2) ),
% 0.64/1.04 inference(weigh,[status(thm)],['0.41.0.0']),
% 0.64/1.04 [weight('<119,8,7,[0,0,0,3]>')]).
% 0.64/1.04 cnf('0.41.2.0',plain,
% 0.64/1.04 ( mult(mult(op_c,mult(op_c,X1)),X2) = mult(op_c,mult(X1,mult(op_c,X2))) ),
% 0.64/1.04 inference(orient,[status(thm)],['0.41.1.0',theory(equality)]),
% 0.64/1.04 [x,rule_40]).
% 0.64/1.04 cnf('0.58.0.0',plain,
% 0.64/1.04 ( mult(op_c,mult(X1,mult(op_c,op_c))) = mult(op_c,mult(op_c,mult(op_c,X1))) ),
% 0.64/1.04 inference(cp,[status(thm)],['0.41.2.0','0.8.2.0',theory(equality)]),
% 0.64/1.04 [pos('L','L')]).
% 0.64/1.04 cnf('0.58.1.0',plain,
% 0.64/1.04 ( mult(X1,mult(op_c,op_c)) = mult(op_c,mult(op_c,X1)) ),
% 0.64/1.04 inference(weigh,[status(thm)],['0.58.0.0']),
% 0.64/1.04 [weight('<120,41,8,[1,0,0,0]>')]).
% 0.64/1.04 cnf('0.58.2.0',plain,
% 0.64/1.04 ( mult(X1,mult(op_c,op_c)) = mult(op_c,mult(op_c,X1)) ),
% 0.64/1.04 inference(activate,[status(thm)],['0.58.1.0']),
% 0.64/1.04 [equation_4]).
% 0.64/1.04 cnf('1.0.0.0',conjecture,
% 0.64/1.04 ( mult(mult(op_c,op_c),a) = mult(a,mult(op_c,op_c)) ),
% 0.64/1.04 file('/tmp/WALDMEISTER_18293_n020',conjecture_1)).
% 0.64/1.04 cnf('1.0.0.1',plain,
% 0.64/1.04 ( mult(op_c,mult(op_c,a)) = mult(a,mult(op_c,op_c)) ),
% 0.64/1.04 inference(reduction,[status(thm)],['1.0.0.0','0.21.2.0',theory(equality)]),
% 0.64/1.04 [pos('L','L')]).
% 0.64/1.04 cnf('1.0.0.2',plain,
% 0.64/1.04 ( mult(op_c,mult(op_c,a)) = mult(op_c,mult(op_c,a)) ),
% 0.64/1.04 inference(reduction,[status(thm)],['1.0.0.1','0.58.2.0',theory(equality)]),
% 0.64/1.04 [pos('R','L')]).
% 0.64/1.04 cnf('1.0.0.3',plain,
% 0.64/1.04 ( $true ),
% 0.64/1.04 inference(trivial,[status(thm)],['1.0.0.2',theory(equality)]),
% 0.64/1.04 [conjecture_1]).
% 0.64/1.04
% 0.64/1.04 Proved Goals:
% 0.64/1.04 No. 1: mult(mult(op_c,op_c),a) ?= mult(a,mult(op_c,op_c)) joined, current: mult(op_c,mult(op_c,a)) = mult(op_c,mult(op_c,a))
% 0.64/1.04 1 goal was specified, which was proved.
% 0.64/1.04 % SZS output end CNFRefutation
% 0.64/1.04 #END OF PROOF
% 0.64/1.04
% 0.64/1.04 Problem WALDMEISTER_18293_n020
% 0.64/1.04 CPs.gen 947
% 0.64/1.04 CPs.reexp 0
% 0.64/1.04 Select 121
% 0.64/1.04 R 54
% 0.64/1.04 E 4
% 0.64/1.04 vsize 6.5M
% 0.64/1.04 rss 3.8M
% 0.64/1.04 process.time 0.006s
% 0.64/1.04 wallclock.time 0.006s
% 0.64/1.04 status S
% 0.64/1.04
% 0.64/1.04
% 0.64/1.04 Waldmeister states: Goal proved.
% 0.64/1.04 % SZS status Unsatisfiable
%------------------------------------------------------------------------------