TSTP Solution File: ROB008-1 by Waldmeister---710
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : ROB008-1 : TPTP v8.1.0. Released v1.0.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 : Mon Jul 18 20:57:14 EDT 2022
% Result : Unsatisfiable 0.64s 1.03s
% Output : CNFRefutation 0.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10 % Problem : ROB008-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.11 % Command : woody %s
% 0.11/0.31 % Computer : n023.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Thu Jun 9 15:53:07 EDT 2022
% 0.17/0.31 % CPUTime :
% 0.64/1.02 ********************************************************************************
% 0.64/1.02 * W A L D M E I S T E R \| \ / \|/ *
% 0.64/1.02 * |/ | \/ | *
% 0.64/1.02 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.64/1.02 * A. Jaeger and B. Loechner | | *
% 0.64/1.02 * <waldmeister@informatik.uni-kl.de> | *
% 0.64/1.02 ********************************************************************************
% 0.64/1.02
% 0.64/1.02
% 0.64/1.02 Goals:
% 0.64/1.02 ------
% 0.64/1.02
% 0.64/1.02 ( 1) add(a,b) ?=? a
% 0.64/1.02
% 0.64/1.02 Detected structure: RobbinsAlgebra
% 0.64/1.02 ********************************************************************************
% 0.64/1.02 ****************************** COMPLETION - PROOF ******************************
% 0.64/1.02 ********************************************************************************
% 0.64/1.02
% 0.64/1.03 joined goal: 1 add(a,b) ?= a to a
% 0.64/1.03 goal joined
% 0.64/1.03 % SZS status Unsatisfiable
% 0.64/1.03 #START OF PROOF
% 0.64/1.03 % SZS output start CNFRefutation
% 0.64/1.03 cnf('0.1.0.0',axiom,
% 0.64/1.03 ( X1 = negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) ),
% 0.64/1.03 file('/tmp/WALDMEISTER_31873_n023')).
% 0.64/1.03 cnf('0.1.1.0',plain,
% 0.64/1.03 ( X1 = negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) ),
% 0.64/1.03 inference(weigh,[status(thm)],['0.1.0.0']),
% 0.64/1.03 [weight('<0,0,0,[0,0,0,1]>')]).
% 0.64/1.03 cnf('0.1.2.0',plain,
% 0.64/1.03 ( negate(add(negate(add(X1,X2)),negate(add(X1,negate(X2))))) = X1 ),
% 0.64/1.03 inference(orient,[status(thm)],['0.1.1.0',theory(equality)]),
% 0.64/1.03 [x,rule_1]).
% 0.64/1.03 cnf('0.2.0.0',axiom,
% 0.64/1.03 ( add(X1,X2) = add(X2,X1) ),
% 0.64/1.03 file('/tmp/WALDMEISTER_31873_n023')).
% 0.64/1.03 cnf('0.2.1.0',plain,
% 0.64/1.03 ( add(X1,X2) = add(X2,X1) ),
% 0.64/1.03 inference(weigh,[status(thm)],['0.2.0.0']),
% 0.64/1.03 [weight('<1,0,0,[0,0,0,2]>')]).
% 0.64/1.03 cnf('0.2.2.0',plain,
% 0.64/1.03 ( add(X1,X2) = add(X2,X1) ),
% 0.64/1.03 inference(activate,[status(thm)],['0.2.1.0']),
% 0.64/1.03 [equation_1]).
% 0.64/1.03 cnf('0.3.0.0',axiom,
% 0.64/1.03 ( add(X1,add(X2,X3)) = add(add(X1,X2),X3) ),
% 0.64/1.03 file('/tmp/WALDMEISTER_31873_n023')).
% 0.64/1.03 cnf('0.3.1.0',plain,
% 0.64/1.03 ( add(X1,add(X2,X3)) = add(add(X1,X2),X3) ),
% 0.64/1.03 inference(weigh,[status(thm)],['0.3.0.0']),
% 0.64/1.03 [weight('<2,0,0,[0,0,0,3]>')]).
% 0.64/1.03 cnf('0.3.2.0',plain,
% 0.64/1.03 ( add(add(X1,X2),X3) = add(X1,add(X2,X3)) ),
% 0.64/1.03 inference(orient,[status(thm)],['0.3.1.0',theory(equality)]),
% 0.64/1.03 [x,rule_2]).
% 0.64/1.03 cnf('0.4.0.0',axiom,
% 0.64/1.03 ( negate(add(a,add(b,negate(c)))) = negate(add(a,negate(add(b,c)))) ),
% 0.64/1.03 file('/tmp/WALDMEISTER_31873_n023')).
% 0.64/1.03 cnf('0.4.1.0',plain,
% 0.64/1.03 ( negate(add(a,add(b,negate(c)))) = negate(add(a,negate(add(b,c)))) ),
% 0.64/1.03 inference(weigh,[status(thm)],['0.4.0.0']),
% 0.64/1.03 [weight('<3,0,0,[0,0,0,4]>')]).
% 0.64/1.03 cnf('0.4.1.1',plain,
% 0.64/1.03 ( negate(add(a,add(b,negate(c)))) = negate(add(a,negate(add(c,b)))) ),
% 0.64/1.03 inference(reduction,[status(thm)],['0.4.1.0','0.2.2.0',theory(equality)]),
% 0.64/1.03 [pos('R.1.2.1','L')]).
% 0.64/1.03 cnf('0.4.2.0',plain,
% 0.64/1.03 ( negate(add(a,negate(add(c,b)))) = negate(add(a,add(b,negate(c)))) ),
% 0.64/1.03 inference(orient,[status(thm)],['0.4.1.1',theory(equality)]),
% 0.64/1.03 [x,rule_3]).
% 0.64/1.03 cnf('0.5.0.0',plain,
% 0.64/1.03 ( X1 = negate(add(negate(add(X2,X1)),negate(add(X1,negate(X2))))) ),
% 0.64/1.03 inference(cp,[status(thm)],['0.1.2.0','0.2.2.0',theory(equality)]),
% 0.64/1.03 [pos('L.1.1.1','L')]).
% 0.64/1.03 cnf('0.5.1.0',plain,
% 0.64/1.03 ( X1 = negate(add(negate(add(X2,X1)),negate(add(X1,negate(X2))))) ),
% 0.64/1.03 inference(weigh,[status(thm)],['0.5.0.0']),
% 0.64/1.03 [weight('<39,2,1,[0,0,0,3]>')]).
% 0.64/1.03 cnf('0.5.2.0',plain,
% 0.64/1.03 ( negate(add(negate(add(X1,X2)),negate(add(X2,negate(X1))))) = X2 ),
% 0.64/1.03 inference(orient,[status(thm)],['0.5.1.0',theory(equality)]),
% 0.64/1.03 [x,rule_4]).
% 0.64/1.03 cnf('0.17.0.0',plain,
% 0.64/1.03 ( add(X1,add(X2,X3)) = add(X3,add(X1,X2)) ),
% 0.64/1.03 inference(cp,[status(thm)],['0.3.2.0','0.2.2.0',theory(equality)]),
% 0.64/1.03 [pos('L','L')]).
% 0.64/1.03 cnf('0.17.1.0',plain,
% 0.64/1.03 ( add(X1,add(X2,X3)) = add(X3,add(X1,X2)) ),
% 0.64/1.03 inference(weigh,[status(thm)],['0.17.0.0']),
% 0.64/1.03 [weight('<50,3,2,[1,0,0,0]>')]).
% 0.64/1.03 cnf('0.17.2.0',plain,
% 0.64/1.03 ( add(X1,add(X2,X3)) = add(X3,add(X1,X2)) ),
% 0.64/1.03 inference(activate,[status(thm)],['0.17.1.0']),
% 0.64/1.03 [equation_2]).
% 0.64/1.03 cnf('0.18.0.0',plain,
% 0.64/1.03 ( negate(add(a,negate(add(c,b)))) = negate(add(a,add(b,negate(c)))) ),
% 0.64/1.03 inference(interreduction_right,[status(thm)],['0.4.2.0'])).
% 0.64/1.03 cnf('0.18.1.0',plain,
% 0.64/1.03 ( negate(add(a,negate(add(c,b)))) = negate(add(a,add(b,negate(c)))) ),
% 0.64/1.03 inference(weigh,[status(thm)],['0.18.0.0']),
% 0.64/1.03 [weight('<27,4,17,[0,0,0,0]>')]).
% 0.64/1.03 cnf('0.18.1.1',plain,
% 0.64/1.03 ( negate(add(a,negate(add(c,b)))) = negate(add(b,add(negate(c),a))) ),
% 0.64/1.03 inference(reduction,[status(thm)],['0.18.1.0','0.17.2.0',theory(equality)]),
% 0.64/1.03 [pos('R.1','R')]).
% 0.64/1.03 cnf('0.18.1.2',plain,
% 0.64/1.03 ( negate(add(a,negate(add(c,b)))) = negate(add(b,add(a,negate(c)))) ),
% 0.64/1.03 inference(reduction,[status(thm)],['0.18.1.1','0.2.2.0',theory(equality)]),
% 0.64/1.03 [pos('R.1.2','L')]).
% 0.64/1.03 cnf('0.18.2.0',plain,
% 0.64/1.03 ( negate(add(a,negate(add(c,b)))) = negate(add(b,add(a,negate(c)))) ),
% 0.64/1.03 inference(orient,[status(thm)],['0.18.1.2',theory(equality)]),
% 0.64/1.03 [u,rule_16]).
% 0.64/1.03 cnf('0.34.0.0',plain,
% 0.64/1.03 ( add(X1,X2) = negate(add(negate(add(X2,add(X3,X1))),negate(add(add(X1,X2),negate(X3))))) ),
% 0.64/1.03 inference(cp,[status(thm)],['0.5.2.0','0.17.2.0',theory(equality)]),
% 0.64/1.03 [pos('L.1.1.1','L')]).
% 0.64/1.03 cnf('0.34.0.1',plain,
% 0.64/1.03 ( add(X1,X2) = negate(add(negate(add(X2,add(X3,X1))),negate(add(X1,add(X2,negate(X3)))))) ),
% 0.64/1.03 inference(reduction,[status(thm)],['0.34.0.0','0.3.2.0',theory(equality)]),
% 0.64/1.03 [pos('R.1.2.1','L')]).
% 0.64/1.03 cnf('0.34.1.0',plain,
% 0.64/1.03 ( add(X1,X2) = negate(add(negate(add(X2,add(X3,X1))),negate(add(X1,add(X2,negate(X3)))))) ),
% 0.64/1.03 inference(weigh,[status(thm)],['0.34.0.1']),
% 0.64/1.03 [weight('<59,17,5,[0,0,0,3]>')]).
% 0.64/1.03 cnf('0.34.2.0',plain,
% 0.64/1.03 ( negate(add(negate(add(X1,add(X2,X3))),negate(add(X3,add(X1,negate(X2)))))) = add(X3,X1) ),
% 0.64/1.03 inference(orient,[status(thm)],['0.34.1.0',theory(equality)]),
% 0.64/1.03 [x,rule_30]).
% 0.64/1.03 cnf('0.39.0.0',plain,
% 0.64/1.03 ( a = negate(add(negate(add(a,add(c,b))),negate(add(b,add(a,negate(c)))))) ),
% 0.64/1.03 inference(cp,[status(thm)],['0.1.2.0','0.18.2.0',theory(equality)]),
% 0.64/1.03 [pos('L.1.2','L')]).
% 0.64/1.03 cnf('0.39.1.0',plain,
% 0.64/1.03 ( a = negate(add(negate(add(a,add(c,b))),negate(add(b,add(a,negate(c)))))) ),
% 0.64/1.03 inference(weigh,[status(thm)],['0.39.0.0']),
% 0.64/1.03 [weight('<59,18,1,[0,0,0,6]>')]).
% 0.64/1.03 cnf('0.39.1.1',plain,
% 0.64/1.03 ( a = add(b,a) ),
% 0.64/1.03 inference(reduction,[status(thm)],['0.39.1.0','0.34.2.0',theory(equality)]),
% 0.64/1.03 [pos('R','L')]).
% 0.64/1.03 cnf('0.39.2.0',plain,
% 0.64/1.03 ( add(b,a) = a ),
% 0.64/1.03 inference(orient,[status(thm)],['0.39.1.1',theory(equality)]),
% 0.64/1.03 [x,rule_35]).
% 0.64/1.03 cnf('1.0.0.0',conjecture,
% 0.64/1.03 ( add(a,b) = a ),
% 0.64/1.03 file('/tmp/WALDMEISTER_31873_n023',conjecture_1)).
% 0.64/1.03 cnf('1.0.0.1',plain,
% 0.64/1.03 ( add(b,a) = a ),
% 0.64/1.03 inference(reduction,[status(thm)],['1.0.0.0','0.2.2.0',theory(equality)]),
% 0.64/1.03 [pos('L','L')]).
% 0.64/1.03 cnf('1.0.0.2',plain,
% 0.64/1.03 ( a = a ),
% 0.64/1.03 inference(reduction,[status(thm)],['1.0.0.1','0.39.2.0',theory(equality)]),
% 0.64/1.03 [pos('L','L')]).
% 0.64/1.03 cnf('1.0.0.3',plain,
% 0.64/1.03 ( $true ),
% 0.64/1.03 inference(trivial,[status(thm)],['1.0.0.2',theory(equality)]),
% 0.64/1.03 [conjecture_1]).
% 0.64/1.03
% 0.64/1.03 Proved Goals:
% 0.64/1.03 No. 1: add(a,b) ?= a joined, current: a = a
% 0.64/1.03 1 goal was specified, which was proved.
% 0.64/1.03 % SZS output end CNFRefutation
% 0.64/1.03 #END OF PROOF
% 0.64/1.03
% 0.64/1.03 Problem WALDMEISTER_31873_n023
% 0.64/1.03 CPs.gen 1740
% 0.64/1.03 CPs.reexp 0
% 0.64/1.03 Select 109
% 0.64/1.03 R 35
% 0.64/1.03 E 4
% 0.64/1.03 vsize 6.5M
% 0.64/1.03 rss 3.8M
% 0.64/1.03 process.time 0.014s
% 0.64/1.03 wallclock.time 0.014s
% 0.64/1.03 status S
% 0.64/1.03
% 0.64/1.03
% 0.64/1.03 Waldmeister states: Goal proved.
% 0.64/1.03 % SZS status Unsatisfiable
%------------------------------------------------------------------------------