TSTP Solution File: LDA001-1 by Waldmeister---710
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : LDA001-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 : Sun Jul 17 16:46:45 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.00/0.11 % Problem : LDA001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.12 % Command : woody %s
% 0.12/0.33 % Computer : n023.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 May 30 02:29:57 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.64/1.03 ********************************************************************************
% 0.64/1.03 * W A L D M E I S T E R \| \ / \|/ *
% 0.64/1.03 * |/ | \/ | *
% 0.64/1.03 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.64/1.03 * A. Jaeger and B. Loechner | | *
% 0.64/1.03 * <waldmeister@informatik.uni-kl.de> | *
% 0.64/1.03 ********************************************************************************
% 0.64/1.03
% 0.64/1.03
% 0.64/1.03 Goals:
% 0.64/1.03 ------
% 0.64/1.03
% 0.64/1.03 ( 1) f(f(n3,n2),u) ?=? f(f(u,u),u)
% 0.64/1.03
% 0.64/1.03 Detected structure: LDAlgebra
% 0.64/1.03 ********************************************************************************
% 0.64/1.03 ****************************** COMPLETION - PROOF ******************************
% 0.64/1.03 ********************************************************************************
% 0.64/1.03
% 0.64/1.03 joined goal: 1 f(f(n3,n2),u) ?= f(f(u,u),u) to f(n3,f(u,n3))
% 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 ( f(X1,f(X2,X3)) = f(f(X1,X2),f(X1,X3)) ),
% 0.64/1.03 file('/tmp/WALDMEISTER_4892_n023')).
% 0.64/1.03 cnf('0.1.1.0',plain,
% 0.64/1.03 ( f(X1,f(X2,X3)) = f(f(X1,X2),f(X1,X3)) ),
% 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 ( f(f(X1,X2),f(X1,X3)) = f(X1,f(X2,X3)) ),
% 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 ( f(n2,n2) = u ),
% 0.64/1.03 file('/tmp/WALDMEISTER_4892_n023')).
% 0.64/1.03 cnf('0.2.1.0',plain,
% 0.64/1.03 ( f(n2,n2) = u ),
% 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 ( f(n2,n2) = u ),
% 0.64/1.03 inference(orient,[status(thm)],['0.2.1.0',theory(equality)]),
% 0.64/1.03 [u,rule_2]).
% 0.64/1.03 cnf('0.3.0.0',axiom,
% 0.64/1.03 ( f(n2,n1) = n3 ),
% 0.64/1.03 file('/tmp/WALDMEISTER_4892_n023')).
% 0.64/1.03 cnf('0.3.1.0',plain,
% 0.64/1.03 ( f(n2,n1) = n3 ),
% 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 ( f(n2,n1) = n3 ),
% 0.64/1.03 inference(orient,[status(thm)],['0.3.1.0',theory(equality)]),
% 0.64/1.03 [u,rule_3]).
% 0.64/1.03 cnf('0.4.0.0',axiom,
% 0.64/1.03 ( f(n1,n1) = n2 ),
% 0.64/1.03 file('/tmp/WALDMEISTER_4892_n023')).
% 0.64/1.03 cnf('0.4.1.0',plain,
% 0.64/1.03 ( f(n1,n1) = n2 ),
% 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.2.0',plain,
% 0.64/1.03 ( f(n1,n1) = n2 ),
% 0.64/1.03 inference(orient,[status(thm)],['0.4.1.0',theory(equality)]),
% 0.64/1.03 [u,rule_4]).
% 0.64/1.03 cnf('0.5.0.0',plain,
% 0.64/1.03 ( f(n2,f(n2,X1)) = f(u,f(n2,X1)) ),
% 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','L')]).
% 0.64/1.03 cnf('0.5.1.0',plain,
% 0.64/1.03 ( f(n2,f(n2,X1)) = f(u,f(n2,X1)) ),
% 0.64/1.03 inference(weigh,[status(thm)],['0.5.0.0']),
% 0.64/1.03 [weight('<65,2,1,[0,0,0,1]>')]).
% 0.64/1.03 cnf('0.5.2.0',plain,
% 0.64/1.03 ( f(n2,f(n2,X1)) = f(u,f(n2,X1)) ),
% 0.64/1.03 inference(orient,[status(thm)],['0.5.1.0',theory(equality)]),
% 0.64/1.03 [u,rule_5]).
% 0.64/1.03 cnf('0.6.0.0',plain,
% 0.64/1.03 ( f(u,f(n2,n2)) = f(n2,u) ),
% 0.64/1.03 inference(cp,[status(thm)],['0.5.2.0','0.2.2.0',theory(equality)]),
% 0.64/1.03 [pos('L.2','L')]).
% 0.64/1.03 cnf('0.6.0.1',plain,
% 0.64/1.03 ( f(u,u) = f(n2,u) ),
% 0.64/1.03 inference(reduction,[status(thm)],['0.6.0.0','0.2.2.0',theory(equality)]),
% 0.64/1.03 [pos('L.2','L')]).
% 0.64/1.03 cnf('0.6.1.0',plain,
% 0.64/1.03 ( f(u,u) = f(n2,u) ),
% 0.64/1.03 inference(weigh,[status(thm)],['0.6.0.1']),
% 0.64/1.03 [weight('<27,5,2,[1,0,0,2]>')]).
% 0.64/1.03 cnf('0.6.2.0',plain,
% 0.64/1.03 ( f(n2,u) = f(u,u) ),
% 0.64/1.03 inference(orient,[status(thm)],['0.6.1.0',theory(equality)]),
% 0.64/1.03 [x,rule_6]).
% 0.64/1.03 cnf('0.10.0.0',plain,
% 0.64/1.03 ( f(n2,f(n1,X1)) = f(n3,f(n2,X1)) ),
% 0.64/1.03 inference(cp,[status(thm)],['0.1.2.0','0.3.2.0',theory(equality)]),
% 0.64/1.03 [pos('L.1','L')]).
% 0.64/1.03 cnf('0.10.1.0',plain,
% 0.64/1.03 ( f(n2,f(n1,X1)) = f(n3,f(n2,X1)) ),
% 0.64/1.03 inference(weigh,[status(thm)],['0.10.0.0']),
% 0.64/1.03 [weight('<65,3,1,[0,0,0,1]>')]).
% 0.64/1.03 cnf('0.10.2.0',plain,
% 0.64/1.03 ( f(n2,f(n1,X1)) = f(n3,f(n2,X1)) ),
% 0.64/1.03 inference(orient,[status(thm)],['0.10.1.0',theory(equality)]),
% 0.64/1.03 [u,rule_10]).
% 0.64/1.03 cnf('0.11.0.0',plain,
% 0.64/1.03 ( f(n3,f(n2,n1)) = f(n2,n2) ),
% 0.64/1.03 inference(cp,[status(thm)],['0.10.2.0','0.4.2.0',theory(equality)]),
% 0.64/1.03 [pos('L.2','L')]).
% 0.64/1.03 cnf('0.11.0.1',plain,
% 0.64/1.03 ( f(n3,n3) = f(n2,n2) ),
% 0.64/1.03 inference(reduction,[status(thm)],['0.11.0.0','0.3.2.0',theory(equality)]),
% 0.64/1.03 [pos('L.2','L')]).
% 0.64/1.03 cnf('0.11.0.2',plain,
% 0.64/1.03 ( f(n3,n3) = u ),
% 0.64/1.03 inference(reduction,[status(thm)],['0.11.0.1','0.2.2.0',theory(equality)]),
% 0.64/1.03 [pos('R','L')]).
% 0.64/1.03 cnf('0.11.1.0',plain,
% 0.64/1.03 ( f(n3,n3) = u ),
% 0.64/1.03 inference(weigh,[status(thm)],['0.11.0.2']),
% 0.64/1.03 [weight('<19,10,4,[1,0,0,2]>')]).
% 0.64/1.03 cnf('0.11.2.0',plain,
% 0.64/1.03 ( f(n3,n3) = u ),
% 0.64/1.03 inference(orient,[status(thm)],['0.11.1.0',theory(equality)]),
% 0.64/1.03 [u,rule_11]).
% 0.64/1.03 cnf('0.13.0.0',plain,
% 0.64/1.03 ( f(n1,f(n1,X1)) = f(n2,f(n1,X1)) ),
% 0.64/1.03 inference(cp,[status(thm)],['0.1.2.0','0.4.2.0',theory(equality)]),
% 0.64/1.03 [pos('L.1','L')]).
% 0.64/1.03 cnf('0.13.1.0',plain,
% 0.64/1.03 ( f(n1,f(n1,X1)) = f(n2,f(n1,X1)) ),
% 0.64/1.03 inference(weigh,[status(thm)],['0.13.0.0']),
% 0.64/1.03 [weight('<65,4,1,[0,0,0,1]>')]).
% 0.64/1.03 cnf('0.13.1.1',plain,
% 0.64/1.03 ( f(n1,f(n1,X1)) = f(n3,f(n2,X1)) ),
% 0.64/1.03 inference(reduction,[status(thm)],['0.13.1.0','0.10.2.0',theory(equality)]),
% 0.64/1.03 [pos('R','L')]).
% 0.64/1.03 cnf('0.13.2.0',plain,
% 0.64/1.03 ( f(n1,f(n1,X1)) = f(n3,f(n2,X1)) ),
% 0.64/1.03 inference(orient,[status(thm)],['0.13.1.1',theory(equality)]),
% 0.64/1.03 [u,rule_13]).
% 0.64/1.03 cnf('0.14.0.0',plain,
% 0.64/1.03 ( f(n3,f(n2,n1)) = f(n1,n2) ),
% 0.64/1.03 inference(cp,[status(thm)],['0.13.2.0','0.4.2.0',theory(equality)]),
% 0.64/1.03 [pos('L.2','L')]).
% 0.64/1.03 cnf('0.14.0.1',plain,
% 0.64/1.03 ( f(n3,n3) = f(n1,n2) ),
% 0.64/1.03 inference(reduction,[status(thm)],['0.14.0.0','0.3.2.0',theory(equality)]),
% 0.64/1.03 [pos('L.2','L')]).
% 0.64/1.03 cnf('0.14.0.2',plain,
% 0.64/1.03 ( u = f(n1,n2) ),
% 0.64/1.03 inference(reduction,[status(thm)],['0.14.0.1','0.11.2.0',theory(equality)]),
% 0.64/1.03 [pos('L','L')]).
% 0.64/1.03 cnf('0.14.1.0',plain,
% 0.64/1.03 ( u = f(n1,n2) ),
% 0.64/1.03 inference(weigh,[status(thm)],['0.14.0.2']),
% 0.64/1.03 [weight('<19,13,4,[1,0,0,2]>')]).
% 0.64/1.03 cnf('0.14.2.0',plain,
% 0.64/1.03 ( f(n1,n2) = u ),
% 0.64/1.03 inference(orient,[status(thm)],['0.14.1.0',theory(equality)]),
% 0.64/1.03 [x,rule_14]).
% 0.64/1.03 cnf('1.0.0.0',conjecture,
% 0.64/1.03 ( f(f(n3,n2),u) = f(f(u,u),u) ),
% 0.64/1.03 file('/tmp/WALDMEISTER_4892_n023',conjecture_1)).
% 0.64/1.03 cnf('1.0.0.1',plain,
% 0.64/1.03 ( f(f(n3,n2),f(n2,n2)) = f(f(u,u),u) ),
% 0.64/1.03 inference(reduction,[status(thm)],['1.0.0.0','0.2.2.0',theory(equality)]),
% 0.64/1.03 [pos('L.2','R')]).
% 0.64/1.03 cnf('1.0.0.2',plain,
% 0.64/1.03 ( f(f(n3,n2),f(n2,f(n1,n1))) = f(f(u,u),u) ),
% 0.64/1.03 inference(reduction,[status(thm)],['1.0.0.1','0.4.2.0',theory(equality)]),
% 0.64/1.03 [pos('L.2.2','R')]).
% 0.64/1.03 cnf('1.0.0.3',plain,
% 0.64/1.03 ( f(f(n3,n2),f(n2,f(n1,n1))) = f(f(n2,u),u) ),
% 0.64/1.03 inference(reduction,[status(thm)],['1.0.0.2','0.6.2.0',theory(equality)]),
% 0.64/1.03 [pos('R.1','R')]).
% 0.64/1.03 cnf('1.0.0.4',plain,
% 0.64/1.03 ( f(f(n3,n2),f(n3,f(n2,n1))) = f(f(n2,u),u) ),
% 0.64/1.03 inference(reduction,[status(thm)],['1.0.0.3','0.10.2.0',theory(equality)]),
% 0.64/1.03 [pos('L.2','L')]).
% 0.64/1.03 cnf('1.0.0.5',plain,
% 0.64/1.03 ( f(f(n3,n2),f(n3,f(n2,n1))) = f(f(n2,u),f(n3,n3)) ),
% 0.64/1.03 inference(reduction,[status(thm)],['1.0.0.4','0.11.2.0',theory(equality)]),
% 0.64/1.03 [pos('R.2','R')]).
% 0.64/1.03 cnf('1.0.0.6',plain,
% 0.64/1.03 ( f(n3,f(n2,f(n2,n1))) = f(f(n2,u),f(n3,n3)) ),
% 0.64/1.03 inference(reduction,[status(thm)],['1.0.0.5','0.1.2.0',theory(equality)]),
% 0.64/1.03 [pos('L','L')]).
% 0.64/1.03 cnf('1.0.0.7',plain,
% 0.64/1.03 ( f(n3,f(u,f(n2,n1))) = f(f(n2,u),f(n3,n3)) ),
% 0.64/1.03 inference(reduction,[status(thm)],['1.0.0.6','0.5.2.0',theory(equality)]),
% 0.64/1.03 [pos('L.2','L')]).
% 0.64/1.03 cnf('1.0.0.8',plain,
% 0.64/1.03 ( f(n3,f(u,n3)) = f(f(n2,u),f(n3,n3)) ),
% 0.64/1.03 inference(reduction,[status(thm)],['1.0.0.7','0.3.2.0',theory(equality)]),
% 0.64/1.03 [pos('L.2.2','L')]).
% 0.64/1.03 cnf('1.0.0.9',plain,
% 0.64/1.03 ( f(n3,f(u,n3)) = f(f(n2,f(n1,n2)),f(n3,n3)) ),
% 0.64/1.03 inference(reduction,[status(thm)],['1.0.0.8','0.14.2.0',theory(equality)]),
% 0.64/1.03 [pos('R.1.2','R')]).
% 0.64/1.03 cnf('1.0.0.10',plain,
% 0.64/1.03 ( f(n3,f(u,n3)) = f(f(n3,f(n2,n2)),f(n3,n3)) ),
% 0.64/1.03 inference(reduction,[status(thm)],['1.0.0.9','0.10.2.0',theory(equality)]),
% 0.64/1.03 [pos('R.1','L')]).
% 0.64/1.03 cnf('1.0.0.11',plain,
% 0.64/1.03 ( f(n3,f(u,n3)) = f(f(n3,u),f(n3,n3)) ),
% 0.64/1.03 inference(reduction,[status(thm)],['1.0.0.10','0.2.2.0',theory(equality)]),
% 0.64/1.03 [pos('R.1.2','L')]).
% 0.64/1.03 cnf('1.0.0.12',plain,
% 0.64/1.03 ( f(n3,f(u,n3)) = f(n3,f(u,n3)) ),
% 0.64/1.03 inference(reduction,[status(thm)],['1.0.0.11','0.1.2.0',theory(equality)]),
% 0.64/1.03 [pos('R','L')]).
% 0.64/1.03 cnf('1.0.0.13',plain,
% 0.64/1.03 ( $true ),
% 0.64/1.03 inference(trivial,[status(thm)],['1.0.0.12',theory(equality)]),
% 0.64/1.03 [conjecture_1]).
% 0.64/1.03
% 0.64/1.03 Proved Goals:
% 0.64/1.03 No. 1: f(f(n3,n2),u) ?= f(f(u,u),u) joined, current: f(n3,f(u,n3)) = f(n3,f(u,n3))
% 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_4892_n023
% 0.64/1.03 CPs.gen 50
% 0.64/1.03 CPs.reexp 0
% 0.64/1.03 Select 14
% 0.64/1.03 R 14
% 0.64/1.03 E 0
% 0.64/1.03 vsize 6.4M
% 0.64/1.03 rss 3.8M
% 0.64/1.03 process.time 0.003s
% 0.64/1.03 wallclock.time 0.003s
% 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
%------------------------------------------------------------------------------