TSTP Solution File: GRP710-11 by Waldmeister---710
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : GRP710-11 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : woody %s
% Computer : n023.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:28:12 EDT 2022
% Result : Unsatisfiable 0.61s 1.05s
% Output : CNFRefutation 0.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP710-11 : TPTP v8.1.0. Released v8.1.0.
% 0.07/0.13 % Command : woody %s
% 0.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 13 10:46:21 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.61/1.05 ********************************************************************************
% 0.61/1.05 * W A L D M E I S T E R \| \ / \|/ *
% 0.61/1.05 * |/ | \/ | *
% 0.61/1.05 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.61/1.05 * A. Jaeger and B. Loechner | | *
% 0.61/1.05 * <waldmeister@informatik.uni-kl.de> | *
% 0.61/1.05 ********************************************************************************
% 0.61/1.05
% 0.61/1.05
% 0.61/1.05 Goals:
% 0.61/1.05 ------
% 0.61/1.05
% 0.61/1.05 ( 1) true ?= false
% 0.61/1.05 using narrowing to prove mult(x1,x4) ?= x3
% 0.61/1.05
% 0.61/1.05 Detected structure: Praeloop
% 0.61/1.05 ********************************************************************************
% 0.61/1.05 ****************************** COMPLETION - PROOF ******************************
% 0.61/1.05 ********************************************************************************
% 0.61/1.05
% 0.61/1.05 joined goal: 1 mult(x1,x4) ?= x3 to false
% 0.61/1.05 goal joined
% 0.61/1.05 % SZS status Unsatisfiable
% 0.61/1.05 #START OF PROOF
% 0.61/1.05 % SZS output start CNFRefutation
% 0.61/1.05 cnf('0.1.0.0',axiom,
% 0.61/1.05 ( X1 = mult(X1,unit) ),
% 0.61/1.05 file('/tmp/WALDMEISTER_19187_n023')).
% 0.61/1.05 cnf('0.1.1.0',plain,
% 0.61/1.05 ( X1 = mult(X1,unit) ),
% 0.61/1.05 inference(weigh,[status(thm)],['0.1.0.0']),
% 0.61/1.05 [weight('<0,0,0,[0,0,0,1]>')]).
% 0.61/1.05 cnf('0.1.2.0',plain,
% 0.61/1.05 ( mult(X1,unit) = X1 ),
% 0.61/1.05 inference(orient,[status(thm)],['0.1.1.0',theory(equality)]),
% 0.61/1.05 [x,rule_1]).
% 0.61/1.05 cnf('0.2.0.0',axiom,
% 0.61/1.05 ( X1 = mult(unit,X1) ),
% 0.61/1.05 file('/tmp/WALDMEISTER_19187_n023')).
% 0.61/1.05 cnf('0.2.1.0',plain,
% 0.61/1.05 ( X1 = mult(unit,X1) ),
% 0.61/1.05 inference(weigh,[status(thm)],['0.2.0.0']),
% 0.61/1.05 [weight('<1,0,0,[0,0,0,2]>')]).
% 0.61/1.05 cnf('0.2.2.0',plain,
% 0.61/1.05 ( mult(unit,X1) = X1 ),
% 0.61/1.05 inference(orient,[status(thm)],['0.2.1.0',theory(equality)]),
% 0.61/1.05 [x,rule_2]).
% 0.61/1.05 cnf('0.3.0.0',axiom,
% 0.61/1.05 ( mult(X1,mult(X2,mult(X2,X3))) = mult(mult(mult(X1,X2),X2),X3) ),
% 0.61/1.05 file('/tmp/WALDMEISTER_19187_n023')).
% 0.61/1.05 cnf('0.3.1.0',plain,
% 0.61/1.05 ( mult(X1,mult(X2,mult(X2,X3))) = mult(mult(mult(X1,X2),X2),X3) ),
% 0.61/1.05 inference(weigh,[status(thm)],['0.3.0.0']),
% 0.61/1.05 [weight('<2,0,0,[0,0,0,3]>')]).
% 0.61/1.05 cnf('0.3.2.0',plain,
% 0.61/1.05 ( mult(mult(mult(X1,X2),X2),X3) = mult(X1,mult(X2,mult(X2,X3))) ),
% 0.61/1.05 inference(orient,[status(thm)],['0.3.1.0',theory(equality)]),
% 0.61/1.05 [x,rule_3]).
% 0.61/1.05 cnf('0.5.0.0',axiom,
% 0.61/1.05 ( mult(i(X1),X1) = unit ),
% 0.61/1.05 file('/tmp/WALDMEISTER_19187_n023')).
% 0.61/1.05 cnf('0.5.1.0',plain,
% 0.61/1.05 ( mult(i(X1),X1) = unit ),
% 0.61/1.05 inference(weigh,[status(thm)],['0.5.0.0']),
% 0.61/1.05 [weight('<4,0,0,[0,0,0,5]>')]).
% 0.61/1.05 cnf('0.5.2.0',plain,
% 0.61/1.05 ( mult(i(X1),X1) = unit ),
% 0.61/1.05 inference(orient,[status(thm)],['0.5.1.0',theory(equality)]),
% 0.61/1.05 [u,rule_5]).
% 0.61/1.05 cnf('0.6.0.0',axiom,
% 0.61/1.05 ( eq(X1,X1) = true ),
% 0.61/1.05 file('/tmp/WALDMEISTER_19187_n023')).
% 0.61/1.05 cnf('0.6.1.0',plain,
% 0.61/1.05 ( eq(X1,X1) = true ),
% 0.61/1.05 inference(weigh,[status(thm)],['0.6.0.0']),
% 0.61/1.05 [weight('<5,0,0,[0,0,0,6]>')]).
% 0.61/1.05 cnf('0.6.2.0',plain,
% 0.61/1.05 ( eq(X1,X1) = true ),
% 0.61/1.05 inference(orient,[status(thm)],['0.6.1.0',theory(equality)]),
% 0.61/1.05 [u,rule_6]).
% 0.61/1.05 cnf('0.7.0.0',axiom,
% 0.61/1.05 ( eq(mult(X1,x4),x3) = false ),
% 0.61/1.05 file('/tmp/WALDMEISTER_19187_n023')).
% 0.61/1.05 cnf('0.7.1.0',plain,
% 0.61/1.05 ( eq(mult(X1,x4),x3) = false ),
% 0.61/1.05 inference(weigh,[status(thm)],['0.7.0.0']),
% 0.61/1.05 [weight('<6,0,0,[0,0,0,7]>')]).
% 0.61/1.05 cnf('0.7.2.0',plain,
% 0.61/1.05 ( eq(mult(X1,x4),x3) = false ),
% 0.61/1.05 inference(orient,[status(thm)],['0.7.1.0',theory(equality)]),
% 0.61/1.05 [u,rule_7]).
% 0.61/1.05 cnf('0.10.0.0',plain,
% 0.61/1.05 ( mult(X1,mult(X2,mult(X2,unit))) = mult(mult(X1,X2),X2) ),
% 0.61/1.05 inference(cp,[status(thm)],['0.3.2.0','0.1.2.0',theory(equality)]),
% 0.61/1.05 [pos('L','L')]).
% 0.61/1.05 cnf('0.10.0.1',plain,
% 0.61/1.05 ( mult(X1,mult(X2,X2)) = mult(mult(X1,X2),X2) ),
% 0.61/1.05 inference(reduction,[status(thm)],['0.10.0.0','0.1.2.0',theory(equality)]),
% 0.61/1.05 [pos('L.2.2','L')]).
% 0.61/1.05 cnf('0.10.1.0',plain,
% 0.61/1.05 ( mult(X1,mult(X2,X2)) = mult(mult(X1,X2),X2) ),
% 0.61/1.05 inference(weigh,[status(thm)],['0.10.0.1']),
% 0.61/1.05 [weight('<65,3,1,[1,0,0,0]>')]).
% 0.61/1.05 cnf('0.10.2.0',plain,
% 0.61/1.05 ( mult(mult(X1,X2),X2) = mult(X1,mult(X2,X2)) ),
% 0.61/1.05 inference(orient,[status(thm)],['0.10.1.0',theory(equality)]),
% 0.61/1.05 [x,rule_10]).
% 0.61/1.05 cnf('0.12.0.0',plain,
% 0.61/1.05 ( mult(i(X1),mult(X1,X1)) = mult(unit,X1) ),
% 0.61/1.05 inference(cp,[status(thm)],['0.10.2.0','0.5.2.0',theory(equality)]),
% 0.61/1.05 [pos('L.1','L')]).
% 0.61/1.05 cnf('0.12.0.1',plain,
% 0.61/1.05 ( mult(i(X1),mult(X1,X1)) = X1 ),
% 0.61/1.05 inference(reduction,[status(thm)],['0.12.0.0','0.2.2.0',theory(equality)]),
% 0.61/1.05 [pos('R','L')]).
% 0.61/1.05 cnf('0.12.1.0',plain,
% 0.61/1.05 ( mult(i(X1),mult(X1,X1)) = X1 ),
% 0.61/1.05 inference(weigh,[status(thm)],['0.12.0.1']),
% 0.61/1.05 [weight('<55,10,5,[1,0,0,1]>')]).
% 0.61/1.05 cnf('0.12.2.0',plain,
% 0.61/1.05 ( mult(i(X1),mult(X1,X1)) = X1 ),
% 0.61/1.05 inference(orient,[status(thm)],['0.12.1.0',theory(equality)]),
% 0.61/1.05 [u,rule_12]).
% 0.61/1.05 cnf('0.15.0.0',plain,
% 0.61/1.05 ( false = eq(mult(X1,mult(x4,x4)),x3) ),
% 0.61/1.05 inference(cp,[status(thm)],['0.7.2.0','0.10.2.0',theory(equality)]),
% 0.61/1.05 [pos('L.1','L')]).
% 0.61/1.05 cnf('0.15.1.0',plain,
% 0.61/1.05 ( false = eq(mult(X1,mult(x4,x4)),x3) ),
% 0.61/1.05 inference(weigh,[status(thm)],['0.15.0.0']),
% 0.61/1.05 [weight('<18,10,7,[0,0,0,1]>')]).
% 0.61/1.05 cnf('0.15.2.0',plain,
% 0.61/1.05 ( eq(mult(X1,mult(x4,x4)),x3) = false ),
% 0.61/1.05 inference(orient,[status(thm)],['0.15.1.0',theory(equality)]),
% 0.61/1.05 [x,rule_15]).
% 0.61/1.05 cnf('0.16.0.0',plain,
% 0.61/1.05 ( mult(mult(mult(X1,X2),X2),X3) = mult(X1,mult(X2,mult(X2,X3))) ),
% 0.61/1.05 inference(interreduction_right,[status(thm)],['0.3.2.0'])).
% 0.61/1.05 cnf('0.16.0.1',plain,
% 0.61/1.05 ( mult(mult(X1,mult(X2,X2)),X3) = mult(X1,mult(X2,mult(X2,X3))) ),
% 0.61/1.05 inference(reduction,[status(thm)],['0.16.0.0','0.10.2.0',theory(equality)]),
% 0.61/1.05 [pos('L.1','L')]).
% 0.61/1.05 cnf('0.16.1.0',plain,
% 0.61/1.05 ( mult(mult(X1,mult(X2,X2)),X3) = mult(X1,mult(X2,mult(X2,X3))) ),
% 0.61/1.05 inference(weigh,[status(thm)],['0.16.0.1']),
% 0.61/1.05 [weight('<119,3,10,[0,0,0,0]>')]).
% 0.61/1.05 cnf('0.16.2.0',plain,
% 0.61/1.05 ( mult(mult(X1,mult(X2,X2)),X3) = mult(X1,mult(X2,mult(X2,X3))) ),
% 0.61/1.05 inference(orient,[status(thm)],['0.16.1.0',theory(equality)]),
% 0.61/1.05 [u,rule_16]).
% 0.61/1.05 cnf('0.29.0.0',plain,
% 0.61/1.05 ( false = eq(mult(X1,mult(X2,mult(X2,mult(x4,x4)))),x3) ),
% 0.61/1.05 inference(cp,[status(thm)],['0.15.2.0','0.16.2.0',theory(equality)]),
% 0.61/1.05 [pos('L.1','L')]).
% 0.61/1.05 cnf('0.29.1.0',plain,
% 0.61/1.05 ( false = eq(mult(X1,mult(X2,mult(X2,mult(x4,x4)))),x3) ),
% 0.61/1.05 inference(weigh,[status(thm)],['0.29.0.0']),
% 0.61/1.05 [weight('<50,16,15,[0,0,0,1]>')]).
% 0.61/1.05 cnf('0.29.2.0',plain,
% 0.61/1.05 ( eq(mult(X1,mult(X2,mult(X2,mult(x4,x4)))),x3) = false ),
% 0.61/1.05 inference(orient,[status(thm)],['0.29.1.0',theory(equality)]),
% 0.61/1.05 [x,rule_29]).
% 0.61/1.05 cnf('0.31.0.0',plain,
% 0.61/1.05 ( false = eq(mult(X1,mult(i(x4),x4)),x3) ),
% 0.61/1.05 inference(cp,[status(thm)],['0.29.2.0','0.12.2.0',theory(equality)]),
% 0.61/1.05 [pos('L.1.2.2','L')]).
% 0.61/1.05 cnf('0.31.0.1',plain,
% 0.61/1.05 ( false = eq(mult(X1,unit),x3) ),
% 0.61/1.05 inference(reduction,[status(thm)],['0.31.0.0','0.5.2.0',theory(equality)]),
% 0.61/1.05 [pos('R.1.2','L')]).
% 0.61/1.05 cnf('0.31.0.2',plain,
% 0.61/1.05 ( false = eq(X1,x3) ),
% 0.61/1.05 inference(reduction,[status(thm)],['0.31.0.1','0.1.2.0',theory(equality)]),
% 0.61/1.05 [pos('R.1','L')]).
% 0.61/1.05 cnf('0.31.1.0',plain,
% 0.61/1.05 ( false = eq(X1,x3) ),
% 0.61/1.05 inference(weigh,[status(thm)],['0.31.0.2']),
% 0.61/1.05 [weight('<0,29,12,[1,0,0,5]>')]).
% 0.61/1.05 cnf('0.31.2.0',plain,
% 0.61/1.05 ( eq(X1,x3) = false ),
% 0.61/1.05 inference(orient,[status(thm)],['0.31.1.0',theory(equality)]),
% 0.61/1.05 [x,rule_31]).
% 0.61/1.05 cnf('0.32.0.0',plain,
% 0.61/1.05 ( false = true ),
% 0.61/1.05 inference(cp,[status(thm)],['0.31.2.0','0.6.2.0',theory(equality)]),
% 0.61/1.05 [pos('L','L')]).
% 0.61/1.05 cnf('0.32.1.0',plain,
% 0.61/1.05 ( false = true ),
% 0.61/1.05 inference(weigh,[status(thm)],['0.32.0.0']),
% 0.61/1.05 [weight('<5,31,6,[1,0,0,0]>')]).
% 0.61/1.05 cnf('0.32.2.0',plain,
% 0.61/1.05 ( true = false ),
% 0.61/1.05 inference(orient,[status(thm)],['0.32.1.0',theory(equality)]),
% 0.61/1.05 [x,rule_32]).
% 0.61/1.05 cnf('1.0.0.0',conjecture,
% 0.61/1.05 ( true = false ),
% 0.61/1.05 file('/tmp/WALDMEISTER_19187_n023',conjecture_1)).
% 0.61/1.05 cnf('1.0.0.1',plain,
% 0.61/1.05 ( false = false ),
% 0.61/1.05 inference(reduction,[status(thm)],['1.0.0.0','0.32.2.0',theory(equality)]),
% 0.61/1.05 [pos('L','L')]).
% 0.61/1.05 cnf('1.0.0.2',plain,
% 0.61/1.05 ( $true ),
% 0.61/1.05 inference(trivial,[status(thm)],['1.0.0.1',theory(equality)]),
% 0.61/1.05 [conjecture_1]).
% 0.61/1.05
% 0.61/1.05 Proved Goals:
% 0.61/1.05 No. 1: true ?= false, current false ?= false
% 0.61/1.05 using narrowing to prove mult(x1,x4) ?= x3
% 0.61/1.05
% 0.61/1.05 1 goal was specified, which was proved.
% 0.61/1.05 % SZS output end CNFRefutation
% 0.61/1.05 #END OF PROOF
% 0.61/1.05
% 0.61/1.05 Problem WALDMEISTER_19187_n023
% 0.61/1.05 CPs.gen 290
% 0.61/1.05 CPs.reexp 0
% 0.61/1.05 Select 51
% 0.61/1.05 R 32
% 0.61/1.05 E 0
% 0.61/1.05 vsize 6.5M
% 0.61/1.05 rss 3.8M
% 0.61/1.05 process.time 0.003s
% 0.61/1.05 wallclock.time 0.003s
% 0.61/1.05 status S
% 0.61/1.05
% 0.61/1.05
% 0.61/1.05 Waldmeister states: Goal proved.
% 0.61/1.05 % SZS status Unsatisfiable
%------------------------------------------------------------------------------